fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156900707
Last Updated
Jun 28, 2021

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
16246.867 3600000.00 3061058.00 347077.20 1 1 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/mcc2021-input.r292-tall-162124156900707.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r292-tall-162124156900707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 40K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 12 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.4K May 11 19:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 11 19:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 11 16:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 16:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 39M May 12 08:13 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 gen-UpperBounds-00
FORMULA_NAME gen-UpperBounds-01
FORMULA_NAME gen-UpperBounds-02
FORMULA_NAME gen-UpperBounds-03
FORMULA_NAME gen-UpperBounds-04
FORMULA_NAME gen-UpperBounds-05
FORMULA_NAME gen-UpperBounds-06
FORMULA_NAME gen-UpperBounds-07
FORMULA_NAME gen-UpperBounds-08
FORMULA_NAME gen-UpperBounds-09
FORMULA_NAME gen-UpperBounds-10
FORMULA_NAME gen-UpperBounds-11
FORMULA_NAME gen-UpperBounds-12
FORMULA_NAME gen-UpperBounds-13
FORMULA_NAME gen-UpperBounds-14
FORMULA_NAME gen-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621375100206

Running Version 0
[2021-05-18 21:58:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 21:58:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 21:58:31] [INFO ] Load time of PNML (sax parser for PT used): 979 ms
[2021-05-18 21:58:31] [INFO ] Transformed 20612 places.
[2021-05-18 21:58:31] [INFO ] Transformed 29875 transitions.
[2021-05-18 21:58:31] [INFO ] Parsed PT model containing 20612 places and 29875 transitions in 1190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Normalized transition count is 29275 out of 29875 initially.
// Phase 1: matrix 29275 rows 20612 cols
[2021-05-18 21:58:36] [INFO ] Computed 1353 place invariants in 5057 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :2
[2021-05-18 21:58:42] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20612 cols
[2021-05-18 21:58:46] [INFO ] Computed 1353 place invariants in 4893 ms
[2021-05-18 21:58:50] [INFO ] [Real]Absence check using 78 positive place invariants in 709 ms returned sat
[2021-05-18 21:58:51] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1027 ms returned sat
[2021-05-18 21:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:58: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: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:58:55] [INFO ] [Real]Absence check using 78 positive place invariants in 698 ms returned sat
[2021-05-18 21:58:56] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1032 ms returned sat
[2021-05-18 21:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:58:56] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:00] [INFO ] [Real]Absence check using 78 positive place invariants in 689 ms returned sat
[2021-05-18 21:59:01] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1131 ms returned sat
[2021-05-18 21:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:01] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:05] [INFO ] [Real]Absence check using 78 positive place invariants in 684 ms returned sat
[2021-05-18 21:59:06] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 986 ms returned sat
[2021-05-18 21:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:07] [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 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:10] [INFO ] [Real]Absence check using 78 positive place invariants in 670 ms returned sat
[2021-05-18 21:59:11] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 846 ms returned unsat
[2021-05-18 21:59:14] [INFO ] [Real]Absence check using 78 positive place invariants in 687 ms returned sat
[2021-05-18 21:59:15] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 984 ms returned sat
[2021-05-18 21:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:16] [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 5
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:19] [INFO ] [Real]Absence check using 78 positive place invariants in 705 ms returned sat
[2021-05-18 21:59:20] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 965 ms returned sat
[2021-05-18 21:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:21] [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 6
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:24] [INFO ] [Real]Absence check using 78 positive place invariants in 659 ms returned sat
[2021-05-18 21:59:25] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 944 ms returned sat
[2021-05-18 21:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:26] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:29] [INFO ] [Real]Absence check using 78 positive place invariants in 689 ms returned sat
[2021-05-18 21:59:30] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 860 ms returned unsat
[2021-05-18 21:59:33] [INFO ] [Real]Absence check using 78 positive place invariants in 638 ms returned sat
[2021-05-18 21:59:34] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 998 ms returned sat
[2021-05-18 21:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:35] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:38] [INFO ] [Real]Absence check using 78 positive place invariants in 680 ms returned sat
[2021-05-18 21:59:39] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1009 ms returned unsat
[2021-05-18 21:59:42] [INFO ] [Real]Absence check using 78 positive place invariants in 681 ms returned sat
[2021-05-18 21:59:43] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1128 ms returned sat
[2021-05-18 21:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:59:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-18 21:59:47] [INFO ] [Real]Absence check using 78 positive place invariants in 681 ms returned sat
[2021-05-18 21:59:48] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 995 ms returned unsat
[2021-05-18 21:59:51] [INFO ] [Real]Absence check using 78 positive place invariants in 674 ms returned sat
[2021-05-18 21:59:52] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 878 ms returned unsat
[2021-05-18 21:59:55] [INFO ] [Real]Absence check using 78 positive place invariants in 666 ms returned sat
[2021-05-18 21:59:56] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 941 ms returned unsat
[2021-05-18 21:59:59] [INFO ] [Real]Absence check using 78 positive place invariants in 684 ms returned sat
[2021-05-18 22:00:00] [INFO ] [Real]Absence check using 78 positive and 1275 generalized place invariants in 1018 ms returned sat
[2021-05-18 22:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:00:01] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [25, 25, 75, 1, 1, 25, 75, 1, 1, 25, 1, 25, 1, 1, 1, 75] Max seen :[0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0]
FORMULA gen-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 20612 places. Attempting structural reductions.
Starting structural reductions, 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.678 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7195 rules applied. Total rules applied 14388 place count 13368 transition count 22680
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14391 place count 13365 transition count 22680
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14391 place count 13365 transition count 22080
Deduced a syphon composed of 600 places in 27 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15591 place count 12765 transition count 22080
Discarding 6592 places :
Symmetric choice reduction at 3 with 6592 rule applications. Total rules 22183 place count 6173 transition count 15488
Iterating global reduction 3 with 6592 rules applied. Total rules applied 28775 place count 6173 transition count 15488
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 28775 place count 6173 transition count 15471
Deduced a syphon composed of 17 places in 22 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 28809 place count 6156 transition count 15471
Discarding 543 places :
Symmetric choice reduction at 3 with 543 rule applications. Total rules 29352 place count 5613 transition count 8955
Iterating global reduction 3 with 543 rules applied. Total rules applied 29895 place count 5613 transition count 8955
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29945 place count 5588 transition count 8930
Free-agglomeration rule (complex) applied 343 times.
Iterating global reduction 3 with 343 rules applied. Total rules applied 30288 place count 5588 transition count 14560
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 3 with 343 rules applied. Total rules applied 30631 place count 5245 transition count 14560
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 4 with 175 rules applied. Total rules applied 30806 place count 5245 transition count 14560
Applied a total of 30806 rules in 8594 ms. Remains 5245 /20612 variables (removed 15367) and now considering 14560/29875 (removed 15315) transitions.
Finished structural reductions, in 1 iterations. Remains : 5245/20612 places, 14560/29875 transitions.
Normalized transition count is 13674 out of 14560 initially.
// Phase 1: matrix 13674 rows 5245 cols
[2021-05-18 22:00:10] [INFO ] Computed 1301 place invariants in 508 ms
Interrupted random walk after 423533 steps, including 5732 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen :{1=1, 2=1, 4=1, 5=1, 7=1, 8=1, 9=1}
FORMULA gen-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 456694 steps, including 861 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :{1=1, 3=1, 5=1}
Interrupted Best-First random walk after 441578 steps, including 833 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen :{1=1, 3=1, 5=1}
Interrupted Best-First random walk after 450707 steps, including 850 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :{1=1, 3=1}
Interrupted Best-First random walk after 453584 steps, including 855 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :{1=1, 3=1, 5=1}
Interrupted Best-First random walk after 457703 steps, including 863 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :{1=1, 5=1}
Interrupted Best-First random walk after 451723 steps, including 852 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :{1=1, 3=1, 5=1}
[2021-05-18 22:01:10] [INFO ] Flow matrix only has 13674 transitions (discarded 886 similar events)
// Phase 1: matrix 13674 rows 5245 cols
[2021-05-18 22:01:11] [INFO ] Computed 1301 place invariants in 497 ms
[2021-05-18 22:01:11] [INFO ] [Real]Absence check using 49 positive place invariants in 120 ms returned sat
[2021-05-18 22:01:12] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 312 ms returned sat
[2021-05-18 22:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:01:21] [INFO ] [Real]Absence check using state equation in 8948 ms returned sat
[2021-05-18 22:01:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:01:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 125 ms returned sat
[2021-05-18 22:01:22] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 332 ms returned sat
[2021-05-18 22:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:01:30] [INFO ] [Nat]Absence check using state equation in 7329 ms returned sat
[2021-05-18 22:01:30] [INFO ] State equation strengthened by 9227 read => feed constraints.
[2021-05-18 22:01:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:01:37] [INFO ] [Nat]Added 9227 Read/Feed constraints in 7038 ms returned unknown
[2021-05-18 22:01:37] [INFO ] [Real]Absence check using 49 positive place invariants in 117 ms returned sat
[2021-05-18 22:01:37] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 32 ms returned unsat
[2021-05-18 22:01:38] [INFO ] [Real]Absence check using 49 positive place invariants in 114 ms returned sat
[2021-05-18 22:01:38] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 299 ms returned sat
[2021-05-18 22:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:01:47] [INFO ] [Real]Absence check using state equation in 8371 ms returned sat
[2021-05-18 22:01:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:01:48] [INFO ] [Nat]Absence check using 49 positive place invariants in 111 ms returned sat
[2021-05-18 22:01:48] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 296 ms returned sat
[2021-05-18 22:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:01:55] [INFO ] [Nat]Absence check using state equation in 6552 ms returned sat
[2021-05-18 22:01:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:02:02] [INFO ] [Nat]Added 9227 Read/Feed constraints in 6939 ms returned unknown
[2021-05-18 22:02:02] [INFO ] [Real]Absence check using 49 positive place invariants in 107 ms returned sat
[2021-05-18 22:02:02] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 226 ms returned unsat
[2021-05-18 22:02:03] [INFO ] [Real]Absence check using 49 positive place invariants in 117 ms returned sat
[2021-05-18 22:02:03] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 317 ms returned sat
[2021-05-18 22:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:02:10] [INFO ] [Real]Absence check using state equation in 6697 ms returned sat
[2021-05-18 22:02:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:02:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 113 ms returned sat
[2021-05-18 22:02:11] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 303 ms returned sat
[2021-05-18 22:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:02:19] [INFO ] [Nat]Absence check using state equation in 7033 ms returned sat
[2021-05-18 22:02:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:02:26] [INFO ] [Nat]Added 9227 Read/Feed constraints in 7217 ms returned unknown
[2021-05-18 22:02:26] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2021-05-18 22:02:27] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 259 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 1, 0, 1, 0, 1]
FORMULA gen-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 5245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5245/5245 places, 14560/14560 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5245 transition count 14556
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 5241 transition count 14556
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 5241 transition count 14550
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 5235 transition count 14550
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 27 place count 5228 transition count 14543
Iterating global reduction 3 with 7 rules applied. Total rules applied 34 place count 5228 transition count 14543
Applied a total of 34 rules in 2334 ms. Remains 5228 /5245 variables (removed 17) and now considering 14543/14560 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5245 places, 14543/14560 transitions.
Normalized transition count is 13657 out of 14543 initially.
// Phase 1: matrix 13657 rows 5228 cols
[2021-05-18 22:02:30] [INFO ] Computed 1301 place invariants in 512 ms
Interrupted random walk after 428121 steps, including 5796 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen :{0=1}
FORMULA gen-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 451158 steps, including 851 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :{}
Interrupted Best-First random walk after 449879 steps, including 848 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :{}
[2021-05-18 22:03:10] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2021-05-18 22:03:10] [INFO ] Computed 1301 place invariants in 487 ms
[2021-05-18 22:03:11] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2021-05-18 22:03:11] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 294 ms returned sat
[2021-05-18 22:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:03:19] [INFO ] [Real]Absence check using state equation in 7702 ms returned sat
[2021-05-18 22:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:03:20] [INFO ] [Nat]Absence check using 49 positive place invariants in 119 ms returned sat
[2021-05-18 22:03:20] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 293 ms returned sat
[2021-05-18 22:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:03:27] [INFO ] [Nat]Absence check using state equation in 7033 ms returned sat
[2021-05-18 22:03:27] [INFO ] State equation strengthened by 9227 read => feed constraints.
[2021-05-18 22:03:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:03:34] [INFO ] [Nat]Added 9227 Read/Feed constraints in 7051 ms returned unknown
[2021-05-18 22:03:35] [INFO ] [Real]Absence check using 49 positive place invariants in 119 ms returned sat
[2021-05-18 22:03:35] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 303 ms returned sat
[2021-05-18 22:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:03:42] [INFO ] [Real]Absence check using state equation in 7294 ms returned sat
[2021-05-18 22:03:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:03:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 114 ms returned sat
[2021-05-18 22:03:44] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 307 ms returned sat
[2021-05-18 22:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:03:52] [INFO ] [Nat]Absence check using state equation in 7888 ms returned sat
[2021-05-18 22:03:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:03:59] [INFO ] [Nat]Added 9227 Read/Feed constraints in 6933 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 5228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5228/5228 places, 14543/14543 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 5228 transition count 14542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5227 transition count 14542
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 5227 transition count 14541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5226 transition count 14541
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 5225 transition count 14540
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 5225 transition count 14540
Applied a total of 6 rules in 2388 ms. Remains 5225 /5228 variables (removed 3) and now considering 14540/14543 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 5225/5228 places, 14540/14543 transitions.
Normalized transition count is 13654 out of 14540 initially.
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:04:01] [INFO ] Computed 1301 place invariants in 530 ms
Interrupted random walk after 429488 steps, including 5815 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen :{}
Interrupted Best-First random walk after 453987 steps, including 856 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen :{}
Interrupted Best-First random walk after 447479 steps, including 844 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :{}
[2021-05-18 22:04:42] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:04:42] [INFO ] Computed 1301 place invariants in 517 ms
[2021-05-18 22:04:43] [INFO ] [Real]Absence check using 49 positive place invariants in 123 ms returned sat
[2021-05-18 22:04:43] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 336 ms returned sat
[2021-05-18 22:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:04:51] [INFO ] [Real]Absence check using state equation in 8355 ms returned sat
[2021-05-18 22:04:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:04:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 110 ms returned sat
[2021-05-18 22:04:53] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 295 ms returned sat
[2021-05-18 22:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:05:00] [INFO ] [Nat]Absence check using state equation in 7478 ms returned sat
[2021-05-18 22:05:00] [INFO ] State equation strengthened by 9227 read => feed constraints.
[2021-05-18 22:05:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:05:07] [INFO ] [Nat]Added 9227 Read/Feed constraints in 6967 ms returned unknown
[2021-05-18 22:05:08] [INFO ] [Real]Absence check using 49 positive place invariants in 113 ms returned sat
[2021-05-18 22:05:08] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 292 ms returned sat
[2021-05-18 22:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:05:16] [INFO ] [Real]Absence check using state equation in 8172 ms returned sat
[2021-05-18 22:05:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:05:17] [INFO ] [Nat]Absence check using 49 positive place invariants in 119 ms returned sat
[2021-05-18 22:05:18] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 313 ms returned sat
[2021-05-18 22:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:05:26] [INFO ] [Nat]Absence check using state equation in 8400 ms returned sat
[2021-05-18 22:05:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:05:33] [INFO ] [Nat]Added 9227 Read/Feed constraints in 6913 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 5225 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 951 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Starting structural reductions, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 968 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
[2021-05-18 22:05:35] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:05:35] [INFO ] Computed 1301 place invariants in 487 ms
[2021-05-18 22:05:41] [INFO ] Implicit Places using invariants in 5904 ms returned []
Implicit Place search using SMT only with invariants took 5908 ms to find 0 implicit places.
[2021-05-18 22:05:41] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:05:41] [INFO ] Computed 1301 place invariants in 505 ms
[2021-05-18 22:05:50] [INFO ] Dead Transitions using invariants and state equation in 8984 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Starting property specific reduction for gen-UpperBounds-03
Normalized transition count is 13654 out of 14540 initially.
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:05:50] [INFO ] Computed 1301 place invariants in 469 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
[2021-05-18 22:05:51] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:05:52] [INFO ] Computed 1301 place invariants in 506 ms
[2021-05-18 22:05:52] [INFO ] [Real]Absence check using 49 positive place invariants in 117 ms returned sat
[2021-05-18 22:05:53] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 297 ms returned sat
[2021-05-18 22:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:05:57] [INFO ] [Real]Absence check using state equation in 4089 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, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 1004 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Normalized transition count is 13654 out of 14540 initially.
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:05:58] [INFO ] Computed 1301 place invariants in 489 ms
Interrupted random walk after 421146 steps, including 5702 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen :{}
Interrupted Best-First random walk after 449842 steps, including 848 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen :{}
[2021-05-18 22:06:33] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:06:34] [INFO ] Computed 1301 place invariants in 518 ms
[2021-05-18 22:06:34] [INFO ] [Real]Absence check using 49 positive place invariants in 111 ms returned sat
[2021-05-18 22:06:35] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 310 ms returned sat
[2021-05-18 22:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:06:43] [INFO ] [Real]Absence check using state equation in 8332 ms returned sat
[2021-05-18 22:06:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:06:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 121 ms returned sat
[2021-05-18 22:06:44] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 300 ms returned sat
[2021-05-18 22:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:06:52] [INFO ] [Nat]Absence check using state equation in 7764 ms returned sat
[2021-05-18 22:06:52] [INFO ] State equation strengthened by 9227 read => feed constraints.
[2021-05-18 22:06:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:06:59] [INFO ] [Nat]Added 9227 Read/Feed constraints in 6940 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, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 1003 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Starting structural reductions, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 973 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
[2021-05-18 22:07:01] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:07:02] [INFO ] Computed 1301 place invariants in 499 ms
[2021-05-18 22:07:07] [INFO ] Implicit Places using invariants in 5320 ms returned []
Implicit Place search using SMT only with invariants took 5329 ms to find 0 implicit places.
[2021-05-18 22:07:07] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:07:07] [INFO ] Computed 1301 place invariants in 483 ms
[2021-05-18 22:07:15] [INFO ] Dead Transitions using invariants and state equation in 8640 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Ending property specific reduction for gen-UpperBounds-03 in 85448 ms.
Starting property specific reduction for gen-UpperBounds-07
Normalized transition count is 13654 out of 14540 initially.
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:07:16] [INFO ] Computed 1301 place invariants in 473 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
[2021-05-18 22:07:17] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:07:17] [INFO ] Computed 1301 place invariants in 520 ms
[2021-05-18 22:07:18] [INFO ] [Real]Absence check using 49 positive place invariants in 116 ms returned sat
[2021-05-18 22:07:18] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 290 ms returned sat
[2021-05-18 22:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:07:22] [INFO ] [Real]Absence check using state equation in 4104 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, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 980 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Normalized transition count is 13654 out of 14540 initially.
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:07:24] [INFO ] Computed 1301 place invariants in 523 ms
Interrupted random walk after 419890 steps, including 5682 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen :{}
Interrupted Best-First random walk after 459951 steps, including 867 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen :{}
[2021-05-18 22:07:59] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:07:59] [INFO ] Computed 1301 place invariants in 478 ms
[2021-05-18 22:08:00] [INFO ] [Real]Absence check using 49 positive place invariants in 119 ms returned sat
[2021-05-18 22:08:00] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 310 ms returned sat
[2021-05-18 22:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:09] [INFO ] [Real]Absence check using state equation in 8998 ms returned sat
[2021-05-18 22:08:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:08:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 121 ms returned sat
[2021-05-18 22:08:10] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 295 ms returned sat
[2021-05-18 22:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:19] [INFO ] [Nat]Absence check using state equation in 8432 ms returned sat
[2021-05-18 22:08:19] [INFO ] State equation strengthened by 9227 read => feed constraints.
[2021-05-18 22:08:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:08:26] [INFO ] [Nat]Added 9227 Read/Feed constraints in 6900 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, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 970 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Starting structural reductions, iteration 0 : 5225/5225 places, 14540/14540 transitions.
Applied a total of 0 rules in 986 ms. Remains 5225 /5225 variables (removed 0) and now considering 14540/14540 (removed 0) transitions.
[2021-05-18 22:08:28] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:08:28] [INFO ] Computed 1301 place invariants in 491 ms
[2021-05-18 22:08:33] [INFO ] Implicit Places using invariants in 5834 ms returned []
Implicit Place search using SMT only with invariants took 5835 ms to find 0 implicit places.
[2021-05-18 22:08:33] [INFO ] Flow matrix only has 13654 transitions (discarded 886 similar events)
// Phase 1: matrix 13654 rows 5225 cols
[2021-05-18 22:08:34] [INFO ] Computed 1301 place invariants in 490 ms
[2021-05-18 22:08:43] [INFO ] Dead Transitions using invariants and state equation in 9471 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5225/5225 places, 14540/14540 transitions.
Ending property specific reduction for gen-UpperBounds-07 in 87649 ms.
[2021-05-18 22:08:44] [INFO ] Flatten gal took : 1029 ms
[2021-05-18 22:08:45] [INFO ] Applying decomposition
[2021-05-18 22:08:46] [INFO ] Flatten gal took : 932 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2641354578669073589.txt, -o, /tmp/graph2641354578669073589.bin, -w, /tmp/graph2641354578669073589.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2641354578669073589.bin, -l, -1, -v, -w, /tmp/graph2641354578669073589.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 22:08:47] [INFO ] Decomposing Gal with order
[2021-05-18 22:08:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 22:08:54] [INFO ] Removed a total of 35939 redundant transitions.
[2021-05-18 22:08:54] [INFO ] Flatten gal took : 5857 ms
[2021-05-18 22:08:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 5642 labels/synchronizations in 1584 ms.
[2021-05-18 22:08:58] [INFO ] Time to serialize gal into /tmp/UpperBounds11605040957125504021.gal : 186 ms
[2021-05-18 22:08:58] [INFO ] Time to serialize properties into /tmp/UpperBounds10853516660526680351.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11605040957125504021.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10853516660526680351.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11605040957125504021.gal -t CGAL -reachable-file /tmp/UpperBounds10853516660526680351.prop --nowitness
Loading property file /tmp/UpperBounds10853516660526680351.prop.
Detected timeout of ITS tools.
[2021-05-18 22:32:37] [INFO ] Flatten gal took : 2683 ms
[2021-05-18 22:32:37] [INFO ] Time to serialize gal into /tmp/UpperBounds3477426721386608396.gal : 222 ms
[2021-05-18 22:32:37] [INFO ] Time to serialize properties into /tmp/UpperBounds6723822529282235959.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3477426721386608396.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6723822529282235959.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3477426721386608396.gal -t CGAL -reachable-file /tmp/UpperBounds6723822529282235959.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6723822529282235959.prop.
Detected timeout of ITS tools.
[2021-05-18 22:56:12] [INFO ] Flatten gal took : 1681 ms
[2021-05-18 22:56:13] [INFO ] Input system was already deterministic with 14540 transitions.
[2021-05-18 22:56:13] [INFO ] Transformed 5225 places.
[2021-05-18 22:56:13] [INFO ] Transformed 14540 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 22:56:50] [INFO ] Time to serialize gal into /tmp/UpperBounds7755653732632533984.gal : 67 ms
[2021-05-18 22:56:50] [INFO ] Time to serialize properties into /tmp/UpperBounds11305684618172581276.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7755653732632533984.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11305684618172581276.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7755653732632533984.gal -t CGAL -reachable-file /tmp/UpperBounds11305684618172581276.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds11305684618172581276.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-4028"
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 r292-tall-162124156900707"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;