About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.352 | 3600000.00 | 3090652.00 | 355357.70 | 1 1 1 ? ? ? 1 1 1 1 1 ? 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r229-tall-167856413900885.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 itstools
Input is MultiCrashLeafsetExtension-PT-S24C12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413900885
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 9.6K Feb 26 03:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 03:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M 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-S24C12-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679608117097
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C12
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-23 21:48:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 21:48:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 21:48:39] [INFO ] Load time of PNML (sax parser for PT used): 680 ms
[2023-03-23 21:48:39] [INFO ] Transformed 20612 places.
[2023-03-23 21:48:39] [INFO ] Transformed 29875 transitions.
[2023-03-23 21:48:39] [INFO ] Parsed PT model containing 20612 places and 29875 transitions and 109334 arcs in 856 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 29275 out of 29875 initially.
// Phase 1: matrix 29275 rows 20612 cols
[2023-03-23 21:48:42] [INFO ] Computed 1353 place invariants in 2972 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
[2023-03-23 21:48:44] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20612 cols
[2023-03-23 21:48:46] [INFO ] Computed 1353 place invariants in 2668 ms
[2023-03-23 21:48:50] [INFO ] [Real]Absence check using 78 positive place invariants in 684 ms returned sat
[2023-03-23 21:48:51] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1088 ms returned sat
[2023-03-23 21:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:48:51] [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: Stream closed... 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: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:48:54] [INFO ] [Real]Absence check using 78 positive place invariants in 657 ms returned sat
[2023-03-23 21:48:55] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 943 ms returned unsat
[2023-03-23 21:48:58] [INFO ] [Real]Absence check using 78 positive place invariants in 648 ms returned sat
[2023-03-23 21:48:59] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1048 ms returned sat
[2023-03-23 21:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:00] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:03] [INFO ] [Real]Absence check using 78 positive place invariants in 671 ms returned sat
[2023-03-23 21:49:04] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1031 ms returned sat
[2023-03-23 21:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:05] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:08] [INFO ] [Real]Absence check using 78 positive place invariants in 639 ms returned sat
[2023-03-23 21:49:09] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 968 ms returned sat
[2023-03-23 21:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:10] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:13] [INFO ] [Real]Absence check using 78 positive place invariants in 671 ms returned sat
[2023-03-23 21:49:14] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1014 ms returned sat
[2023-03-23 21:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:15] [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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:18] [INFO ] [Real]Absence check using 78 positive place invariants in 660 ms returned sat
[2023-03-23 21:49:19] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 879 ms returned unsat
[2023-03-23 21:49:22] [INFO ] [Real]Absence check using 78 positive place invariants in 639 ms returned sat
[2023-03-23 21:49:23] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 883 ms returned unsat
[2023-03-23 21:49:26] [INFO ] [Real]Absence check using 78 positive place invariants in 661 ms returned sat
[2023-03-23 21:49:26] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 832 ms returned unsat
[2023-03-23 21:49:29] [INFO ] [Real]Absence check using 78 positive place invariants in 640 ms returned sat
[2023-03-23 21:49:30] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1017 ms returned sat
[2023-03-23 21:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:31] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:34] [INFO ] [Real]Absence check using 78 positive place invariants in 649 ms returned sat
[2023-03-23 21:49:35] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 897 ms returned unsat
[2023-03-23 21:49:38] [INFO ] [Real]Absence check using 78 positive place invariants in 648 ms returned sat
[2023-03-23 21:49:39] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1047 ms returned sat
[2023-03-23 21:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:40] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:43] [INFO ] [Real]Absence check using 78 positive place invariants in 649 ms returned sat
[2023-03-23 21:49:44] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 885 ms returned unsat
[2023-03-23 21:49:46] [INFO ] [Real]Absence check using 78 positive place invariants in 644 ms returned sat
[2023-03-23 21:49:47] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 917 ms returned unsat
[2023-03-23 21:49:50] [INFO ] [Real]Absence check using 78 positive place invariants in 646 ms returned sat
[2023-03-23 21:49:51] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1048 ms returned sat
[2023-03-23 21:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:52] [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 14
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 21:49:55] [INFO ] [Real]Absence check using 78 positive place invariants in 646 ms returned sat
[2023-03-23 21:49:56] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1035 ms returned sat
[2023-03-23 21:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:49:57] [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 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [75, 1, 75, 25, 25, 75, 1, 1, 1, 75, 1, 1, 1, 1, 75, 75] Max seen :[0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 20612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20612/20612 places, 29875/29875 transitions.
Graph (complete) has 64441 edges and 20612 vertex of which 20560 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.50 ms
Discarding 52 places :
Also discarding 0 output transitions
Drop transitions removed 7192 transitions
Trivial Post-agglo rules discarded 7192 transitions
Performed 7192 trivial Post agglomeration. Transition count delta: 7192
Iterating post reduction 0 with 7192 rules applied. Total rules applied 7193 place count 20560 transition count 22683
Reduce places removed 7192 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 7198 rules applied. Total rules applied 14391 place count 13368 transition count 22677
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 14397 place count 13362 transition count 22677
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14397 place count 13362 transition count 22077
Deduced a syphon composed of 600 places in 23 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15597 place count 12762 transition count 22077
Discarding 6592 places :
Symmetric choice reduction at 3 with 6592 rule applications. Total rules 22189 place count 6170 transition count 15485
Iterating global reduction 3 with 6592 rules applied. Total rules applied 28781 place count 6170 transition count 15485
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 28781 place count 6170 transition count 15468
Deduced a syphon composed of 17 places in 21 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 28815 place count 6153 transition count 15468
Discarding 542 places :
Symmetric choice reduction at 3 with 542 rule applications. Total rules 29357 place count 5611 transition count 8964
Iterating global reduction 3 with 542 rules applied. Total rules applied 29899 place count 5611 transition count 8964
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29949 place count 5586 transition count 8939
Free-agglomeration rule (complex) applied 344 times.
Iterating global reduction 3 with 344 rules applied. Total rules applied 30293 place count 5586 transition count 14557
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 3 with 344 rules applied. Total rules applied 30637 place count 5242 transition count 14557
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 4 with 175 rules applied. Total rules applied 30812 place count 5242 transition count 14557
Applied a total of 30812 rules in 7547 ms. Remains 5242 /20612 variables (removed 15370) and now considering 14557/29875 (removed 15318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7553 ms. Remains : 5242/20612 places, 14557/29875 transitions.
Normalized transition count is 13671 out of 14557 initially.
// Phase 1: matrix 13671 rows 5242 cols
[2023-03-23 21:50:05] [INFO ] Computed 1301 place invariants in 383 ms
Interrupted random walk after 459922 steps, including 6225 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 5
Interrupted Best-First random walk after 501329 steps, including 946 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 5
Interrupted Best-First random walk after 498793 steps, including 941 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 3
Interrupted Best-First random walk after 498825 steps, including 941 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 3
Interrupted Best-First random walk after 502062 steps, including 947 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 2
Interrupted Best-First random walk after 499422 steps, including 942 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 2
Interrupted Best-First random walk after 506389 steps, including 955 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 4
Interrupted Best-First random walk after 492144 steps, including 928 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 2
Interrupted Best-First random walk after 493326 steps, including 930 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 3
Interrupted Best-First random walk after 484642 steps, including 914 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 3
[2023-03-23 21:51:20] [INFO ] Flow matrix only has 13671 transitions (discarded 886 similar events)
// Phase 1: matrix 13671 rows 5242 cols
[2023-03-23 21:51:21] [INFO ] Computed 1301 place invariants in 392 ms
[2023-03-23 21:51:21] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2023-03-23 21:51:21] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 25 ms returned unsat
[2023-03-23 21:51:22] [INFO ] [Real]Absence check using 49 positive place invariants in 110 ms returned sat
[2023-03-23 21:51:22] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 187 ms returned unsat
[2023-03-23 21:51:23] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2023-03-23 21:51:23] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 320 ms returned sat
[2023-03-23 21:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:51:30] [INFO ] [Real]Absence check using state equation in 6899 ms returned sat
[2023-03-23 21:51:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:51:31] [INFO ] [Nat]Absence check using 49 positive place invariants in 105 ms returned sat
[2023-03-23 21:51:31] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 311 ms returned sat
[2023-03-23 21:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:51:37] [INFO ] [Nat]Absence check using state equation in 5708 ms returned sat
[2023-03-23 21:51:37] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-23 21:51:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:51:41] [INFO ] [Nat]Added 9202 Read/Feed constraints in 3847 ms returned sat
[2023-03-23 21:51:43] [INFO ] Computed and/alt/rep : 4620/6660/4620 causal constraints (skipped 9026 transitions) in 1298 ms.
[2023-03-23 21:51:46] [INFO ] Added : 13 causal constraints over 3 iterations in 4508 ms. Result :sat
[2023-03-23 21:51:47] [INFO ] [Real]Absence check using 49 positive place invariants in 127 ms returned sat
[2023-03-23 21:51:47] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 318 ms returned sat
[2023-03-23 21:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:51:54] [INFO ] [Real]Absence check using state equation in 6674 ms returned sat
[2023-03-23 21:51:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:51:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 104 ms returned sat
[2023-03-23 21:51:55] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 321 ms returned sat
[2023-03-23 21:51:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:52:01] [INFO ] [Nat]Absence check using state equation in 5749 ms returned sat
[2023-03-23 21:52:04] [INFO ] [Nat]Added 9202 Read/Feed constraints in 2772 ms returned sat
[2023-03-23 21:52:05] [INFO ] Computed and/alt/rep : 4620/6660/4620 causal constraints (skipped 9026 transitions) in 1194 ms.
[2023-03-23 21:52:08] [INFO ] Added : 11 causal constraints over 3 iterations in 4166 ms. Result :sat
[2023-03-23 21:52:09] [INFO ] [Real]Absence check using 49 positive place invariants in 101 ms returned sat
[2023-03-23 21:52:09] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 320 ms returned sat
[2023-03-23 21:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:52:15] [INFO ] [Real]Absence check using state equation in 5643 ms returned sat
[2023-03-23 21:52:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:52:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 104 ms returned sat
[2023-03-23 21:52:16] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 299 ms returned sat
[2023-03-23 21:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:52:23] [INFO ] [Nat]Absence check using state equation in 7037 ms returned sat
[2023-03-23 21:52:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:52:30] [INFO ] [Nat]Added 9202 Read/Feed constraints in 6400 ms returned sat
[2023-03-23 21:52:31] [INFO ] Computed and/alt/rep : 4620/6660/4620 causal constraints (skipped 9026 transitions) in 1051 ms.
[2023-03-23 21:52:33] [INFO ] Added : 10 causal constraints over 2 iterations in 3232 ms. Result :sat
[2023-03-23 21:52:34] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2023-03-23 21:52:35] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 273 ms returned unsat
[2023-03-23 21:52:35] [INFO ] [Real]Absence check using 49 positive place invariants in 106 ms returned sat
[2023-03-23 21:52:35] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 321 ms returned sat
[2023-03-23 21:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:52:42] [INFO ] [Real]Absence check using state equation in 6908 ms returned sat
[2023-03-23 21:52:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:52:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 107 ms returned sat
[2023-03-23 21:52:44] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 320 ms returned sat
[2023-03-23 21:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:52:51] [INFO ] [Nat]Absence check using state equation in 6956 ms returned sat
[2023-03-23 21:52:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:52:58] [INFO ] [Nat]Added 9202 Read/Feed constraints in 7180 ms returned unknown
[2023-03-23 21:52:58] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2023-03-23 21:52:58] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 113 ms returned unsat
[2023-03-23 21:52:59] [INFO ] [Real]Absence check using 49 positive place invariants in 100 ms returned sat
[2023-03-23 21:52:59] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 110 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 2, 1, 1, 1, 1] Max seen :[1, 1, 0, 0, 0, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 5242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5242/5242 places, 14557/14557 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5242 transition count 14553
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 5238 transition count 14553
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 5233 transition count 14548
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 5233 transition count 14548
Applied a total of 18 rules in 2386 ms. Remains 5233 /5242 variables (removed 9) and now considering 14548/14557 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2386 ms. Remains : 5233/5242 places, 14548/14557 transitions.
Normalized transition count is 13662 out of 14548 initially.
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:53:03] [INFO ] Computed 1301 place invariants in 372 ms
Interrupted random walk after 450843 steps, including 6104 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Interrupted Best-First random walk after 470980 steps, including 888 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 470947 steps, including 888 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 487474 steps, including 919 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
Interrupted Best-First random walk after 481983 steps, including 909 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
[2023-03-23 21:53:53] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:53:54] [INFO ] Computed 1301 place invariants in 385 ms
[2023-03-23 21:53:54] [INFO ] [Real]Absence check using 49 positive place invariants in 111 ms returned sat
[2023-03-23 21:53:54] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 328 ms returned sat
[2023-03-23 21:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:54:02] [INFO ] [Real]Absence check using state equation in 7634 ms returned sat
[2023-03-23 21:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:54:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 100 ms returned sat
[2023-03-23 21:54:03] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 318 ms returned sat
[2023-03-23 21:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:54:10] [INFO ] [Nat]Absence check using state equation in 6516 ms returned sat
[2023-03-23 21:54:10] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-23 21:54:13] [INFO ] [Nat]Added 9202 Read/Feed constraints in 3019 ms returned sat
[2023-03-23 21:54:14] [INFO ] Computed and/alt/rep : 4615/6650/4615 causal constraints (skipped 9022 transitions) in 1064 ms.
[2023-03-23 21:54:17] [INFO ] Added : 13 causal constraints over 3 iterations in 3939 ms. Result :sat
[2023-03-23 21:54:18] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2023-03-23 21:54:19] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 315 ms returned sat
[2023-03-23 21:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:54:26] [INFO ] [Real]Absence check using state equation in 7107 ms returned sat
[2023-03-23 21:54:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:54:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 100 ms returned sat
[2023-03-23 21:54:27] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 326 ms returned sat
[2023-03-23 21:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:54:34] [INFO ] [Nat]Absence check using state equation in 7201 ms returned sat
[2023-03-23 21:54:36] [INFO ] [Nat]Added 9202 Read/Feed constraints in 2511 ms returned sat
[2023-03-23 21:54:38] [INFO ] Computed and/alt/rep : 4615/6650/4615 causal constraints (skipped 9022 transitions) in 1081 ms.
[2023-03-23 21:54:41] [INFO ] Added : 11 causal constraints over 3 iterations in 4069 ms. Result :sat
[2023-03-23 21:54:42] [INFO ] [Real]Absence check using 49 positive place invariants in 110 ms returned sat
[2023-03-23 21:54:42] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 325 ms returned sat
[2023-03-23 21:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:54:51] [INFO ] [Real]Absence check using state equation in 8636 ms returned sat
[2023-03-23 21:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:54:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 110 ms returned sat
[2023-03-23 21:54:52] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 336 ms returned sat
[2023-03-23 21:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:55:01] [INFO ] [Nat]Absence check using state equation in 9364 ms returned sat
[2023-03-23 21:55:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:55:06] [INFO ] [Nat]Added 9202 Read/Feed constraints in 4375 ms returned sat
[2023-03-23 21:55:14] [INFO ] Deduced a trap composed of 668 places in 7761 ms of which 14 ms to minimize.
[2023-03-23 21:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10727 ms
[2023-03-23 21:55:18] [INFO ] Computed and/alt/rep : 4615/6650/4615 causal constraints (skipped 9022 transitions) in 1092 ms.
[2023-03-23 21:55:21] [INFO ] Added : 11 causal constraints over 3 iterations in 4138 ms. Result :sat
[2023-03-23 21:55:22] [INFO ] [Real]Absence check using 49 positive place invariants in 106 ms returned sat
[2023-03-23 21:55:22] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 319 ms returned sat
[2023-03-23 21:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:55:29] [INFO ] [Real]Absence check using state equation in 7183 ms returned sat
[2023-03-23 21:55:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:55:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 104 ms returned sat
[2023-03-23 21:55:30] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 323 ms returned sat
[2023-03-23 21:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:55:37] [INFO ] [Nat]Absence check using state equation in 7044 ms returned sat
[2023-03-23 21:55:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:55:44] [INFO ] [Nat]Added 9202 Read/Feed constraints in 6474 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 5233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5233/5233 places, 14548/14548 transitions.
Applied a total of 0 rules in 983 ms. Remains 5233 /5233 variables (removed 0) and now considering 14548/14548 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 5233/5233 places, 14548/14548 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5233/5233 places, 14548/14548 transitions.
Applied a total of 0 rules in 980 ms. Remains 5233 /5233 variables (removed 0) and now considering 14548/14548 (removed 0) transitions.
[2023-03-23 21:55:47] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
[2023-03-23 21:55:47] [INFO ] Invariant cache hit.
[2023-03-23 21:55:52] [INFO ] Implicit Places using invariants in 4925 ms returned []
Implicit Place search using SMT only with invariants took 4926 ms to find 0 implicit places.
[2023-03-23 21:55:52] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
[2023-03-23 21:55:52] [INFO ] Invariant cache hit.
[2023-03-23 21:56:01] [INFO ] Dead Transitions using invariants and state equation in 8348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14258 ms. Remains : 5233/5233 places, 14548/14548 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-03
Normalized transition count is 13662 out of 14548 initially.
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:56:01] [INFO ] Computed 1301 place invariants in 365 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
[2023-03-23 21:56:02] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:56:02] [INFO ] Computed 1301 place invariants in 416 ms
[2023-03-23 21:56:03] [INFO ] [Real]Absence check using 49 positive place invariants in 124 ms returned sat
[2023-03-23 21:56:03] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 371 ms returned sat
[2023-03-23 21:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:56:07] [INFO ] [Real]Absence check using state equation in 4066 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5233/5233 places, 14548/14548 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5233 transition count 14547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5232 transition count 14547
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5232 transition count 14545
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 5230 transition count 14545
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 5228 transition count 14543
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 5228 transition count 14543
Applied a total of 10 rules in 2388 ms. Remains 5228 /5233 variables (removed 5) and now considering 14543/14548 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2389 ms. Remains : 5228/5233 places, 14543/14548 transitions.
Normalized transition count is 13657 out of 14543 initially.
// Phase 1: matrix 13657 rows 5228 cols
[2023-03-23 21:56:10] [INFO ] Computed 1301 place invariants in 365 ms
Interrupted random walk after 451261 steps, including 6108 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Interrupted Best-First random walk after 480284 steps, including 906 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
[2023-03-23 21:56:45] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2023-03-23 21:56:45] [INFO ] Computed 1301 place invariants in 372 ms
[2023-03-23 21:56:46] [INFO ] [Real]Absence check using 49 positive place invariants in 104 ms returned sat
[2023-03-23 21:56:46] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 307 ms returned sat
[2023-03-23 21:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:56:53] [INFO ] [Real]Absence check using state equation in 6305 ms returned sat
[2023-03-23 21:56:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:56:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 102 ms returned sat
[2023-03-23 21:56:54] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 330 ms returned sat
[2023-03-23 21:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:57:00] [INFO ] [Nat]Absence check using state equation in 6085 ms returned sat
[2023-03-23 21:57:00] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-23 21:57:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:57:08] [INFO ] [Nat]Added 9202 Read/Feed constraints in 7635 ms returned sat
[2023-03-23 21:57:16] [INFO ] Deduced a trap composed of 741 places in 7670 ms of which 6 ms to minimize.
[2023-03-23 21:57:19] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 11034 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 948 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 953 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2023-03-23 21:57:21] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2023-03-23 21:57:21] [INFO ] Invariant cache hit.
[2023-03-23 21:57:29] [INFO ] Implicit Places using invariants in 7671 ms returned []
Implicit Place search using SMT only with invariants took 7672 ms to find 0 implicit places.
[2023-03-23 21:57:29] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2023-03-23 21:57:29] [INFO ] Invariant cache hit.
[2023-03-23 21:57:37] [INFO ] Dead Transitions using invariants and state equation in 8216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16844 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-03 in 96346 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-04
Normalized transition count is 13662 out of 14548 initially.
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:57:37] [INFO ] Computed 1301 place invariants in 363 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
[2023-03-23 21:57:38] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:57:38] [INFO ] Computed 1301 place invariants in 367 ms
[2023-03-23 21:57:39] [INFO ] [Real]Absence check using 49 positive place invariants in 108 ms returned sat
[2023-03-23 21:57:39] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 322 ms returned sat
[2023-03-23 21:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:57:44] [INFO ] [Real]Absence check using state equation in 4155 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5233/5233 places, 14548/14548 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5233 transition count 14547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5232 transition count 14547
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5232 transition count 14545
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 5230 transition count 14545
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 5228 transition count 14543
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 5228 transition count 14543
Applied a total of 10 rules in 2429 ms. Remains 5228 /5233 variables (removed 5) and now considering 14543/14548 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2431 ms. Remains : 5228/5233 places, 14543/14548 transitions.
Normalized transition count is 13657 out of 14543 initially.
// Phase 1: matrix 13657 rows 5228 cols
[2023-03-23 21:57:46] [INFO ] Computed 1301 place invariants in 372 ms
Interrupted random walk after 454493 steps, including 6151 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Interrupted Best-First random walk after 482366 steps, including 910 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
[2023-03-23 21:58:21] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2023-03-23 21:58:22] [INFO ] Computed 1301 place invariants in 369 ms
[2023-03-23 21:58:22] [INFO ] [Real]Absence check using 49 positive place invariants in 108 ms returned sat
[2023-03-23 21:58:23] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 329 ms returned sat
[2023-03-23 21:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:58:29] [INFO ] [Real]Absence check using state equation in 6146 ms returned sat
[2023-03-23 21:58:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:58:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 105 ms returned sat
[2023-03-23 21:58:30] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 314 ms returned sat
[2023-03-23 21:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:58:37] [INFO ] [Nat]Absence check using state equation in 7164 ms returned sat
[2023-03-23 21:58:37] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-23 21:58:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 21:58:42] [INFO ] [Nat]Added 9202 Read/Feed constraints in 4580 ms returned sat
[2023-03-23 21:58:43] [INFO ] Computed and/alt/rep : 4612/6645/4612 causal constraints (skipped 9020 transitions) in 1079 ms.
[2023-03-23 21:58:46] [INFO ] Added : 11 causal constraints over 3 iterations in 4160 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 954 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 958 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2023-03-23 21:58:49] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2023-03-23 21:58:49] [INFO ] Invariant cache hit.
[2023-03-23 21:58:54] [INFO ] Implicit Places using invariants in 5101 ms returned []
Implicit Place search using SMT only with invariants took 5101 ms to find 0 implicit places.
[2023-03-23 21:58:54] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
[2023-03-23 21:58:54] [INFO ] Invariant cache hit.
[2023-03-23 21:59:03] [INFO ] Dead Transitions using invariants and state equation in 8310 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14375 ms. Remains : 5228/5228 places, 14543/14543 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-04 in 85562 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-05
Normalized transition count is 13662 out of 14548 initially.
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:59:03] [INFO ] Computed 1301 place invariants in 363 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
[2023-03-23 21:59:04] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 21:59:04] [INFO ] Computed 1301 place invariants in 368 ms
[2023-03-23 21:59:05] [INFO ] [Real]Absence check using 49 positive place invariants in 108 ms returned sat
[2023-03-23 21:59:05] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 322 ms returned sat
[2023-03-23 21:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:59:09] [INFO ] [Real]Absence check using state equation in 4149 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 5233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5233/5233 places, 14548/14548 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 5233 transition count 14546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5231 transition count 14546
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5231 transition count 14544
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 5229 transition count 14544
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 5227 transition count 14542
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 5227 transition count 14542
Applied a total of 12 rules in 2419 ms. Remains 5227 /5233 variables (removed 6) and now considering 14542/14548 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2420 ms. Remains : 5227/5233 places, 14542/14548 transitions.
Normalized transition count is 13656 out of 14542 initially.
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-23 21:59:12] [INFO ] Computed 1301 place invariants in 366 ms
Interrupted random walk after 447355 steps, including 6055 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Interrupted Best-First random walk after 471660 steps, including 890 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
[2023-03-23 21:59:47] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-23 21:59:47] [INFO ] Computed 1301 place invariants in 372 ms
[2023-03-23 21:59:48] [INFO ] [Real]Absence check using 49 positive place invariants in 104 ms returned sat
[2023-03-23 21:59:48] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 314 ms returned sat
[2023-03-23 21:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:59:55] [INFO ] [Real]Absence check using state equation in 6437 ms returned sat
[2023-03-23 21:59:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:59:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 107 ms returned sat
[2023-03-23 21:59:56] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 330 ms returned sat
[2023-03-23 21:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 22:00:02] [INFO ] [Nat]Absence check using state equation in 6569 ms returned sat
[2023-03-23 22:00:02] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-23 22:00:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 22:00:07] [INFO ] [Nat]Added 9202 Read/Feed constraints in 4517 ms returned sat
[2023-03-23 22:00:08] [INFO ] Computed and/alt/rep : 4611/6644/4611 causal constraints (skipped 9020 transitions) in 1034 ms.
[2023-03-23 22:00:11] [INFO ] Added : 10 causal constraints over 2 iterations in 3229 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 966 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 957 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-23 22:00:13] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-23 22:00:13] [INFO ] Invariant cache hit.
[2023-03-23 22:00:18] [INFO ] Implicit Places using invariants in 5106 ms returned []
Implicit Place search using SMT only with invariants took 5110 ms to find 0 implicit places.
[2023-03-23 22:00:18] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-23 22:00:18] [INFO ] Invariant cache hit.
[2023-03-23 22:00:26] [INFO ] Dead Transitions using invariants and state equation in 7801 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13871 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-05 in 83772 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-11
Normalized transition count is 13662 out of 14548 initially.
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 22:00:27] [INFO ] Computed 1301 place invariants in 378 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
[2023-03-23 22:00:27] [INFO ] Flow matrix only has 13662 transitions (discarded 886 similar events)
// Phase 1: matrix 13662 rows 5233 cols
[2023-03-23 22:00:28] [INFO ] Computed 1301 place invariants in 363 ms
[2023-03-23 22:00:28] [INFO ] [Real]Absence check using 49 positive place invariants in 103 ms returned sat
[2023-03-23 22:00:29] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 322 ms returned sat
[2023-03-23 22:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:00:33] [INFO ] [Real]Absence check using state equation in 4156 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5233/5233 places, 14548/14548 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 5233 transition count 14546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5231 transition count 14546
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 5231 transition count 14543
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 5228 transition count 14543
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 13 place count 5225 transition count 14540
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 5225 transition count 14540
Applied a total of 16 rules in 2410 ms. Remains 5225 /5233 variables (removed 8) and now considering 14540/14548 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2411 ms. Remains : 5225/5233 places, 14540/14548 transitions.
Normalized transition count is 13654 out of 14540 initially.
// Phase 1: matrix 13654 rows 5225 cols
[2023-03-23 22:00:36] [INFO ] Computed 1301 place invariants in 390 ms
Interrupted random walk after 460355 steps, including 6229 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Interrupted Best-First random walk after 499210 steps, including 942 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
[2023-03-23 22:01:11] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2023-03-23 22:01:11] [INFO ] Computed 1301 place invariants in 380 ms
[2023-03-23 22:01:12] [INFO ] [Real]Absence check using 49 positive place invariants in 114 ms returned sat
[2023-03-23 22:01:12] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 314 ms returned sat
[2023-03-23 22:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 22:01:19] [INFO ] [Real]Absence check using state equation in 6616 ms returned sat
[2023-03-23 22:01:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 22:01:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 106 ms returned sat
[2023-03-23 22:01:20] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 316 ms returned sat
[2023-03-23 22:01:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 22:01:26] [INFO ] [Nat]Absence check using state equation in 5799 ms returned sat
[2023-03-23 22:01:26] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-23 22:01:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 22:01:32] [INFO ] [Nat]Added 9202 Read/Feed constraints in 6505 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 5225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 941 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 5225/5225 places, 14540/14540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 941 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
[2023-03-23 22:01:34] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
[2023-03-23 22:01:34] [INFO ] Invariant cache hit.
[2023-03-23 22:01:39] [INFO ] Implicit Places using invariants in 5027 ms returned []
Implicit Place search using SMT only with invariants took 5028 ms to find 0 implicit places.
[2023-03-23 22:01:39] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
[2023-03-23 22:01:39] [INFO ] Invariant cache hit.
[2023-03-23 22:01:48] [INFO ] Dead Transitions using invariants and state equation in 8508 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14480 ms. Remains : 5225/5225 places, 14540/14540 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C12-UpperBounds-11 in 81288 ms.
[2023-03-23 22:01:49] [INFO ] Flatten gal took : 963 ms
[2023-03-23 22:01:49] [INFO ] Applying decomposition
[2023-03-23 22:01:50] [INFO ] Flatten gal took : 599 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17061919506129574933.txt' '-o' '/tmp/graph17061919506129574933.bin' '-w' '/tmp/graph17061919506129574933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17061919506129574933.bin' '-l' '-1' '-v' '-w' '/tmp/graph17061919506129574933.weights' '-q' '0' '-e' '0.001'
[2023-03-23 22:01:51] [INFO ] Decomposing Gal with order
[2023-03-23 22:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 22:01:57] [INFO ] Removed a total of 37636 redundant transitions.
[2023-03-23 22:01:57] [INFO ] Flatten gal took : 4698 ms
[2023-03-23 22:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 3931 labels/synchronizations in 1182 ms.
[2023-03-23 22:02:00] [INFO ] Time to serialize gal into /tmp/UpperBounds7204013052804878925.gal : 191 ms
[2023-03-23 22:02:00] [INFO ] Time to serialize properties into /tmp/UpperBounds574607624514115280.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7204013052804878925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds574607624514115280.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds574607624514115280.prop.
ITS-tools command line returned an error code 137
[2023-03-23 22:18:01] [INFO ] Flatten gal took : 1894 ms
[2023-03-23 22:18:02] [INFO ] Time to serialize gal into /tmp/UpperBounds2181596565718228109.gal : 260 ms
[2023-03-23 22:18:02] [INFO ] Time to serialize properties into /tmp/UpperBounds17563839738510559398.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2181596565718228109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17563839738510559398.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds17563839738510559398.prop.
ITS-tools command line returned an error code 137
[2023-03-23 22:34:10] [INFO ] Flatten gal took : 1938 ms
[2023-03-23 22:34:11] [INFO ] Input system was already deterministic with 14548 transitions.
[2023-03-23 22:34:11] [INFO ] Transformed 5233 places.
[2023-03-23 22:34:11] [INFO ] Transformed 14548 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-23 22:34:43] [INFO ] Time to serialize gal into /tmp/UpperBounds1153332813296722431.gal : 86 ms
[2023-03-23 22:34:43] [INFO ] Time to serialize properties into /tmp/UpperBounds10668399084510504986.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1153332813296722431.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10668399084510504986.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10668399084510504986.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136108 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16281984 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-S24C12"
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-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C12, 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 r229-tall-167856413900885"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C12.tgz
mv MultiCrashLeafsetExtension-PT-S24C12 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 '
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 ;