fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821400813
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16218.071 3600000.00 2742779.00 521957.80 ? 1 1 ? 1 1 1 1 1 1 1 1 1 0 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/mcc2022-input.r132-tall-165271821400813.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821400813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 13K Apr 29 16:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 20M May 10 09:34 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-S32C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652874089759

Running Version 202205111006
[2022-05-18 11:41:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 11:41:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 11:41:32] [INFO ] Load time of PNML (sax parser for PT used): 918 ms
[2022-05-18 11:41:32] [INFO ] Transformed 18180 places.
[2022-05-18 11:41:32] [INFO ] Transformed 28411 transitions.
[2022-05-18 11:41:32] [INFO ] Parsed PT model containing 18180 places and 28411 transitions in 1169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Normalized transition count is 27355 out of 28411 initially.
// Phase 1: matrix 27355 rows 18180 cols
[2022-05-18 11:41:35] [INFO ] Computed 1473 place invariants in 2701 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 241 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :3
[2022-05-18 11:41:36] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18180 cols
[2022-05-18 11:41:39] [INFO ] Computed 1473 place invariants in 2462 ms
[2022-05-18 11:41:42] [INFO ] [Real]Absence check using 78 positive place invariants in 568 ms returned sat
[2022-05-18 11:41:43] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1220 ms returned sat
[2022-05-18 11:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:41:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 11:41:46] [INFO ] [Real]Absence check using 78 positive place invariants in 546 ms returned sat
[2022-05-18 11:41:47] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 663 ms returned unsat
[2022-05-18 11:41:49] [INFO ] [Real]Absence check using 78 positive place invariants in 538 ms returned sat
[2022-05-18 11:41:50] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 680 ms returned unsat
[2022-05-18 11:41:53] [INFO ] [Real]Absence check using 78 positive place invariants in 562 ms returned sat
[2022-05-18 11:41:54] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1287 ms returned sat
[2022-05-18 11:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:41:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 11:41:58] [INFO ] [Real]Absence check using 78 positive place invariants in 576 ms returned sat
[2022-05-18 11:41:59] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 775 ms returned unsat
[2022-05-18 11:42:01] [INFO ] [Real]Absence check using 78 positive place invariants in 615 ms returned sat
[2022-05-18 11:42:02] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 919 ms returned unsat
[2022-05-18 11:42:05] [INFO ] [Real]Absence check using 78 positive place invariants in 589 ms returned sat
[2022-05-18 11:42:06] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 969 ms returned unsat
[2022-05-18 11:42:08] [INFO ] [Real]Absence check using 78 positive place invariants in 553 ms returned sat
[2022-05-18 11:42:09] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 783 ms returned unsat
[2022-05-18 11:42:12] [INFO ] [Real]Absence check using 78 positive place invariants in 534 ms returned sat
[2022-05-18 11:42:12] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 771 ms returned unsat
[2022-05-18 11:42:15] [INFO ] [Real]Absence check using 78 positive place invariants in 514 ms returned sat
[2022-05-18 11:42:16] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1197 ms returned sat
[2022-05-18 11:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:42:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 11:42:20] [INFO ] [Real]Absence check using 78 positive place invariants in 521 ms returned sat
[2022-05-18 11:42:21] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1306 ms returned sat
[2022-05-18 11:42:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:42:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 11:42:25] [INFO ] [Real]Absence check using 78 positive place invariants in 536 ms returned sat
[2022-05-18 11:42:26] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1396 ms returned sat
[2022-05-18 11:42:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:42:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 11:42:30] [INFO ] [Real]Absence check using 78 positive place invariants in 506 ms returned sat
[2022-05-18 11:42:30] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 709 ms returned unsat
[2022-05-18 11:42:33] [INFO ] [Real]Absence check using 78 positive place invariants in 570 ms returned sat
[2022-05-18 11:42:34] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1243 ms returned sat
[2022-05-18 11:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:42: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: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 11:42:38] [INFO ] [Real]Absence check using 78 positive place invariants in 537 ms returned sat
[2022-05-18 11:42:39] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1267 ms returned sat
[2022-05-18 11:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:42:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 99, 33, 33, 1, 1, 99] Max seen :[0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 18180 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18180/18180 places, 28411/28411 transitions.
Graph (complete) has 66065 edges and 18180 vertex of which 18136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.59 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4220 transitions
Trivial Post-agglo rules discarded 4220 transitions
Performed 4220 trivial Post agglomeration. Transition count delta: 4220
Iterating post reduction 0 with 4220 rules applied. Total rules applied 4221 place count 18136 transition count 24191
Reduce places removed 4220 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4222 rules applied. Total rules applied 8443 place count 13916 transition count 24189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8445 place count 13914 transition count 24189
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 264 Pre rules applied. Total rules applied 8445 place count 13914 transition count 23925
Deduced a syphon composed of 264 places in 23 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 8973 place count 13650 transition count 23925
Discarding 3956 places :
Symmetric choice reduction at 3 with 3956 rule applications. Total rules 12929 place count 9694 transition count 19969
Iterating global reduction 3 with 3956 rules applied. Total rules applied 16885 place count 9694 transition count 19969
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16885 place count 9694 transition count 19965
Deduced a syphon composed of 4 places in 21 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16893 place count 9690 transition count 19965
Discarding 986 places :
Symmetric choice reduction at 3 with 986 rule applications. Total rules 17879 place count 8704 transition count 16021
Iterating global reduction 3 with 986 rules applied. Total rules applied 18865 place count 8704 transition count 16021
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 19 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 18929 place count 8672 transition count 15989
Free-agglomeration rule (complex) applied 579 times.
Iterating global reduction 3 with 579 rules applied. Total rules applied 19508 place count 8672 transition count 18368
Reduce places removed 579 places and 0 transitions.
Iterating post reduction 3 with 579 rules applied. Total rules applied 20087 place count 8093 transition count 18368
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 4 with 132 rules applied. Total rules applied 20219 place count 8093 transition count 18368
Applied a total of 20219 rules in 15573 ms. Remains 8093 /18180 variables (removed 10087) and now considering 18368/28411 (removed 10043) transitions.
Finished structural reductions, in 1 iterations. Remains : 8093/18180 places, 18368/28411 transitions.
Normalized transition count is 16803 out of 18368 initially.
// Phase 1: matrix 16803 rows 8093 cols
[2022-05-18 11:42:57] [INFO ] Computed 1429 place invariants in 821 ms
Interrupted random walk after 619001 steps, including 24626 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 4
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 861607 steps, including 3154 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen 1
Interrupted Best-First random walk after 836877 steps, including 3063 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 1
Interrupted Best-First random walk after 848602 steps, including 3106 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 1
Interrupted Best-First random walk after 894044 steps, including 3272 resets, run timeout after 5001 ms. (steps per millisecond=178 ) properties seen 1
Interrupted Best-First random walk after 907366 steps, including 3321 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen 1
[2022-05-18 11:43:52] [INFO ] Flow matrix only has 16803 transitions (discarded 1565 similar events)
// Phase 1: matrix 16803 rows 8093 cols
[2022-05-18 11:43:53] [INFO ] Computed 1429 place invariants in 879 ms
[2022-05-18 11:43:54] [INFO ] [Real]Absence check using 65 positive place invariants in 195 ms returned sat
[2022-05-18 11:43:54] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 453 ms returned sat
[2022-05-18 11:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:44:05] [INFO ] [Real]Absence check using state equation in 10359 ms returned sat
[2022-05-18 11:44:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:44:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 184 ms returned sat
[2022-05-18 11:44:07] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 492 ms returned sat
[2022-05-18 11:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:44:18] [INFO ] [Nat]Absence check using state equation in 11554 ms returned sat
[2022-05-18 11:44:19] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2022-05-18 11:44:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:44:25] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6610 ms returned unknown
[2022-05-18 11:44:26] [INFO ] [Real]Absence check using 65 positive place invariants in 173 ms returned sat
[2022-05-18 11:44:26] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 462 ms returned sat
[2022-05-18 11:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:44:38] [INFO ] [Real]Absence check using state equation in 11430 ms returned sat
[2022-05-18 11:44:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:44:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 180 ms returned sat
[2022-05-18 11:44:40] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 485 ms returned sat
[2022-05-18 11:44:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:44:52] [INFO ] [Nat]Absence check using state equation in 12067 ms returned sat
[2022-05-18 11:44:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:44:58] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6458 ms returned unknown
[2022-05-18 11:44:59] [INFO ] [Real]Absence check using 65 positive place invariants in 188 ms returned sat
[2022-05-18 11:44:59] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 24 ms returned unsat
[2022-05-18 11:45:00] [INFO ] [Real]Absence check using 65 positive place invariants in 178 ms returned sat
[2022-05-18 11:45:01] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 463 ms returned sat
[2022-05-18 11:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:45:11] [INFO ] [Real]Absence check using state equation in 10484 ms returned sat
[2022-05-18 11:45:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:45:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2022-05-18 11:45:13] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 472 ms returned sat
[2022-05-18 11:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:45:25] [INFO ] [Nat]Absence check using state equation in 11647 ms returned sat
[2022-05-18 11:45:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:45:29] [INFO ] [Nat]Added 9154 Read/Feed constraints in 4156 ms returned unsat
[2022-05-18 11:45:30] [INFO ] [Real]Absence check using 65 positive place invariants in 175 ms returned sat
[2022-05-18 11:45:30] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 415 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0, 1] Max seen :[0, 0, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 8093 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8093/8093 places, 18368/18368 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 8093 transition count 18366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8091 transition count 18366
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 8091 transition count 18362
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 8087 transition count 18362
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 8083 transition count 18358
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 8083 transition count 18358
Applied a total of 20 rules in 5396 ms. Remains 8083 /8093 variables (removed 10) and now considering 18358/18368 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 8083/8093 places, 18358/18368 transitions.
Normalized transition count is 16793 out of 18358 initially.
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:45:36] [INFO ] Computed 1429 place invariants in 813 ms
Interrupted random walk after 639984 steps, including 25461 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 903850 steps, including 3308 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen 0
Interrupted Best-First random walk after 913287 steps, including 3343 resets, run timeout after 5001 ms. (steps per millisecond=182 ) properties seen 0
[2022-05-18 11:46:16] [INFO ] Flow matrix only has 16793 transitions (discarded 1565 similar events)
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:46:17] [INFO ] Computed 1429 place invariants in 834 ms
[2022-05-18 11:46:18] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2022-05-18 11:46:19] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 497 ms returned sat
[2022-05-18 11:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:46:29] [INFO ] [Real]Absence check using state equation in 10141 ms returned sat
[2022-05-18 11:46:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:46:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 160 ms returned sat
[2022-05-18 11:46:31] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 480 ms returned sat
[2022-05-18 11:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:46:42] [INFO ] [Nat]Absence check using state equation in 11694 ms returned sat
[2022-05-18 11:46:43] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2022-05-18 11:46:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:46:49] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6482 ms returned unknown
[2022-05-18 11:46:50] [INFO ] [Real]Absence check using 65 positive place invariants in 162 ms returned sat
[2022-05-18 11:46:50] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 527 ms returned sat
[2022-05-18 11:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:47:02] [INFO ] [Real]Absence check using state equation in 11175 ms returned sat
[2022-05-18 11:47:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:47:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 173 ms returned sat
[2022-05-18 11:47:03] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 479 ms returned sat
[2022-05-18 11:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:47:15] [INFO ] [Nat]Absence check using state equation in 11242 ms returned sat
[2022-05-18 11:47:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:47:21] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6468 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 8083 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8083/8083 places, 18358/18358 transitions.
Applied a total of 0 rules in 2038 ms. Remains 8083 /8083 variables (removed 0) and now considering 18358/18358 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8083/8083 places, 18358/18358 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8083/8083 places, 18358/18358 transitions.
Applied a total of 0 rules in 2007 ms. Remains 8083 /8083 variables (removed 0) and now considering 18358/18358 (removed 0) transitions.
[2022-05-18 11:47:25] [INFO ] Flow matrix only has 16793 transitions (discarded 1565 similar events)
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:47:26] [INFO ] Computed 1429 place invariants in 796 ms
[2022-05-18 11:47:27] [INFO ] Implicit Places using invariants in 1619 ms returned []
Implicit Place search using SMT only with invariants took 1620 ms to find 0 implicit places.
[2022-05-18 11:47:27] [INFO ] Flow matrix only has 16793 transitions (discarded 1565 similar events)
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:47:28] [INFO ] Computed 1429 place invariants in 808 ms
[2022-05-18 11:47:28] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8083/8083 places, 18358/18358 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-00
Normalized transition count is 16793 out of 18358 initially.
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:47:29] [INFO ] Computed 1429 place invariants in 910 ms
Incomplete random walk after 10000 steps, including 398 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-05-18 11:47:30] [INFO ] Flow matrix only has 16793 transitions (discarded 1565 similar events)
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:47:31] [INFO ] Computed 1429 place invariants in 805 ms
[2022-05-18 11:47:32] [INFO ] [Real]Absence check using 65 positive place invariants in 159 ms returned sat
[2022-05-18 11:47:32] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 489 ms returned sat
[2022-05-18 11:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:47:36] [INFO ] [Real]Absence check using state equation in 3650 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8083 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8083/8083 places, 18358/18358 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8082 transition count 18357
Applied a total of 2 rules in 3231 ms. Remains 8082 /8083 variables (removed 1) and now considering 18357/18358 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 8082/8083 places, 18357/18358 transitions.
Normalized transition count is 16792 out of 18357 initially.
// Phase 1: matrix 16792 rows 8082 cols
[2022-05-18 11:47:40] [INFO ] Computed 1429 place invariants in 806 ms
Interrupted random walk after 657705 steps, including 26169 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 903863 steps, including 3309 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen 0
[2022-05-18 11:48:15] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2022-05-18 11:48:16] [INFO ] Computed 1429 place invariants in 792 ms
[2022-05-18 11:48:16] [INFO ] [Real]Absence check using 65 positive place invariants in 152 ms returned sat
[2022-05-18 11:48:17] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 489 ms returned sat
[2022-05-18 11:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:48:30] [INFO ] [Real]Absence check using state equation in 13325 ms returned sat
[2022-05-18 11:48:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:48:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 156 ms returned sat
[2022-05-18 11:48:32] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 485 ms returned sat
[2022-05-18 11:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:48:44] [INFO ] [Nat]Absence check using state equation in 11320 ms returned sat
[2022-05-18 11:48:44] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2022-05-18 11:48:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:48:50] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6509 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8082 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 2010 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8082/8082 places, 18357/18357 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1970 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
[2022-05-18 11:48:54] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2022-05-18 11:48:55] [INFO ] Computed 1429 place invariants in 779 ms
[2022-05-18 11:48:56] [INFO ] Implicit Places using invariants in 1546 ms returned []
Implicit Place search using SMT only with invariants took 1549 ms to find 0 implicit places.
[2022-05-18 11:48:56] [INFO ] Flow matrix only has 16792 transitions (discarded 1565 similar events)
// Phase 1: matrix 16792 rows 8082 cols
[2022-05-18 11:48:56] [INFO ] Computed 1429 place invariants in 786 ms
[2022-05-18 11:48:57] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8082/8082 places, 18357/18357 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-00 in 88827 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03
Normalized transition count is 16793 out of 18358 initially.
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:48:58] [INFO ] Computed 1429 place invariants in 796 ms
Incomplete random walk after 10000 steps, including 397 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
[2022-05-18 11:48:59] [INFO ] Flow matrix only has 16793 transitions (discarded 1565 similar events)
// Phase 1: matrix 16793 rows 8083 cols
[2022-05-18 11:48:59] [INFO ] Computed 1429 place invariants in 815 ms
[2022-05-18 11:49:00] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2022-05-18 11:49:01] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 515 ms returned sat
[2022-05-18 11:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:49:04] [INFO ] [Real]Absence check using state equation in 3575 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8083 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8083/8083 places, 18358/18358 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8083 transition count 18357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8082 transition count 18357
Applied a total of 2 rules in 4024 ms. Remains 8082 /8083 variables (removed 1) and now considering 18357/18358 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 8082/8083 places, 18357/18358 transitions.
Normalized transition count is 16791 out of 18357 initially.
// Phase 1: matrix 16791 rows 8082 cols
[2022-05-18 11:49:09] [INFO ] Computed 1429 place invariants in 797 ms
Interrupted random walk after 634440 steps, including 25245 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 925447 steps, including 3388 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 0
[2022-05-18 11:49:44] [INFO ] Flow matrix only has 16791 transitions (discarded 1566 similar events)
// Phase 1: matrix 16791 rows 8082 cols
[2022-05-18 11:49:45] [INFO ] Computed 1429 place invariants in 791 ms
[2022-05-18 11:49:46] [INFO ] [Real]Absence check using 65 positive place invariants in 178 ms returned sat
[2022-05-18 11:49:46] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2022-05-18 11:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:49:57] [INFO ] [Real]Absence check using state equation in 10323 ms returned sat
[2022-05-18 11:49:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:49:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 173 ms returned sat
[2022-05-18 11:49:59] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 460 ms returned sat
[2022-05-18 11:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:50:10] [INFO ] [Nat]Absence check using state equation in 11510 ms returned sat
[2022-05-18 11:50:10] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2022-05-18 11:50:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:50:17] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6497 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8082 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1986 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8082/8082 places, 18357/18357 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8082/8082 places, 18357/18357 transitions.
Applied a total of 0 rules in 1963 ms. Remains 8082 /8082 variables (removed 0) and now considering 18357/18357 (removed 0) transitions.
[2022-05-18 11:50:21] [INFO ] Flow matrix only has 16791 transitions (discarded 1566 similar events)
// Phase 1: matrix 16791 rows 8082 cols
[2022-05-18 11:50:21] [INFO ] Computed 1429 place invariants in 771 ms
[2022-05-18 11:50:22] [INFO ] Implicit Places using invariants in 1510 ms returned []
Implicit Place search using SMT only with invariants took 1511 ms to find 0 implicit places.
[2022-05-18 11:50:22] [INFO ] Flow matrix only has 16791 transitions (discarded 1566 similar events)
// Phase 1: matrix 16791 rows 8082 cols
[2022-05-18 11:50:23] [INFO ] Computed 1429 place invariants in 777 ms
[2022-05-18 11:50:24] [INFO ] Dead Transitions using invariants and state equation in 1538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8082/8082 places, 18357/18357 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03 in 86531 ms.
[2022-05-18 11:50:25] [INFO ] Flatten gal took : 1000 ms
[2022-05-18 11:50:26] [INFO ] Applying decomposition
[2022-05-18 11:50:26] [INFO ] Flatten gal took : 779 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4109119286011546178.txt' '-o' '/tmp/graph4109119286011546178.bin' '-w' '/tmp/graph4109119286011546178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4109119286011546178.bin' '-l' '-1' '-v' '-w' '/tmp/graph4109119286011546178.weights' '-q' '0' '-e' '0.001'
[2022-05-18 11:50:28] [INFO ] Decomposing Gal with order
[2022-05-18 11:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 11:50:36] [INFO ] Removed a total of 21236 redundant transitions.
[2022-05-18 11:50:37] [INFO ] Flatten gal took : 7459 ms
[2022-05-18 11:50:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 16620 labels/synchronizations in 2620 ms.
[2022-05-18 11:50:41] [INFO ] Time to serialize gal into /tmp/UpperBounds11692541054689043619.gal : 206 ms
[2022-05-18 11:50:41] [INFO ] Time to serialize properties into /tmp/UpperBounds9767138866693892416.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11692541054689043619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9767138866693892416.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9767138866693892416.prop.
Detected timeout of ITS tools.
[2022-05-18 12:14:02] [INFO ] Flatten gal took : 5917 ms
[2022-05-18 12:14:03] [INFO ] Time to serialize gal into /tmp/UpperBounds1740665583928709791.gal : 261 ms
[2022-05-18 12:14:03] [INFO ] Time to serialize properties into /tmp/UpperBounds10130497092518395715.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1740665583928709791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10130497092518395715.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds10130497092518395715.prop.
Detected timeout of ITS tools.
[2022-05-18 12:37:26] [INFO ] Flatten gal took : 8981 ms
[2022-05-18 12:37:28] [INFO ] Input system was already deterministic with 18358 transitions.
[2022-05-18 12:37:28] [INFO ] Transformed 8083 places.
[2022-05-18 12:37:28] [INFO ] Transformed 18358 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 12:38:01] [INFO ] Time to serialize gal into /tmp/UpperBounds5880205762233518402.gal : 85 ms
[2022-05-18 12:38:01] [INFO ] Time to serialize properties into /tmp/UpperBounds4681771755520644599.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5880205762233518402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4681771755520644599.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4681771755520644599.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S32C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C04, 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 r132-tall-165271821400813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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