fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S32C04

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 15K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 03:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678724079051

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 16:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 16:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:14:41] [INFO ] Load time of PNML (sax parser for PT used): 587 ms
[2023-03-13 16:14:41] [INFO ] Transformed 18180 places.
[2023-03-13 16:14:41] [INFO ] Transformed 28411 transitions.
[2023-03-13 16:14:41] [INFO ] Parsed PT model containing 18180 places and 28411 transitions and 115534 arcs in 781 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 27355 out of 28411 initially.
// Phase 1: matrix 27355 rows 18180 cols
[2023-03-13 16:14:44] [INFO ] Computed 1473 place invariants in 2509 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 34 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 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 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 34 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :0
[2023-03-13 16:14:45] [INFO ] Flow matrix only has 27355 transitions (discarded 1056 similar events)
// Phase 1: matrix 27355 rows 18180 cols
[2023-03-13 16:14:48] [INFO ] Computed 1473 place invariants in 2460 ms
[2023-03-13 16:14:50] [INFO ] [Real]Absence check using 78 positive place invariants in 589 ms returned sat
[2023-03-13 16:14:51] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1100 ms returned sat
[2023-03-13 16:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:14:53] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:14:55] [INFO ] [Real]Absence check using 78 positive place invariants in 509 ms returned sat
[2023-03-13 16:14:56] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 648 ms returned unsat
[2023-03-13 16:14:58] [INFO ] [Real]Absence check using 78 positive place invariants in 506 ms returned sat
[2023-03-13 16:14:58] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 608 ms returned unsat
[2023-03-13 16:15:01] [INFO ] [Real]Absence check using 78 positive place invariants in 514 ms returned sat
[2023-03-13 16:15:02] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1123 ms returned sat
[2023-03-13 16:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15:03] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:15:06] [INFO ] [Real]Absence check using 78 positive place invariants in 493 ms returned sat
[2023-03-13 16:15:06] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 652 ms returned unsat
[2023-03-13 16:15:09] [INFO ] [Real]Absence check using 78 positive place invariants in 563 ms returned sat
[2023-03-13 16:15:10] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 877 ms returned unsat
[2023-03-13 16:15:12] [INFO ] [Real]Absence check using 78 positive place invariants in 557 ms returned sat
[2023-03-13 16:15:14] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1378 ms returned sat
[2023-03-13 16:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:15:17] [INFO ] [Real]Absence check using 78 positive place invariants in 514 ms returned sat
[2023-03-13 16:15:19] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1155 ms returned sat
[2023-03-13 16:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15:20] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:15:22] [INFO ] [Real]Absence check using 78 positive place invariants in 507 ms returned sat
[2023-03-13 16:15:24] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1164 ms returned sat
[2023-03-13 16:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15:25] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:15:27] [INFO ] [Real]Absence check using 78 positive place invariants in 501 ms returned sat
[2023-03-13 16:15:28] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 641 ms returned unsat
[2023-03-13 16:15:30] [INFO ] [Real]Absence check using 78 positive place invariants in 497 ms returned sat
[2023-03-13 16:15:31] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1117 ms returned sat
[2023-03-13 16:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:15:35] [INFO ] [Real]Absence check using 78 positive place invariants in 516 ms returned sat
[2023-03-13 16:15:36] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 615 ms returned unsat
[2023-03-13 16:15:38] [INFO ] [Real]Absence check using 78 positive place invariants in 507 ms returned sat
[2023-03-13 16:15:39] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 658 ms returned unsat
[2023-03-13 16:15:41] [INFO ] [Real]Absence check using 78 positive place invariants in 508 ms returned sat
[2023-03-13 16:15:42] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1164 ms returned sat
[2023-03-13 16:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15: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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 16:15:46] [INFO ] [Real]Absence check using 78 positive place invariants in 501 ms returned sat
[2023-03-13 16:15:47] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 657 ms returned unsat
[2023-03-13 16:15:49] [INFO ] [Real]Absence check using 78 positive place invariants in 511 ms returned sat
[2023-03-13 16:15:50] [INFO ] [Real]Absence check using 78 positive and 1395 generalized place invariants in 1149 ms returned sat
[2023-03-13 16:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:15:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 99] Max seen :[0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 18180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18180/18180 places, 28411/28411 transitions.
Graph (complete) has 66065 edges and 18180 vertex of which 18136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.59 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4223 transitions
Trivial Post-agglo rules discarded 4223 transitions
Performed 4223 trivial Post agglomeration. Transition count delta: 4223
Iterating post reduction 0 with 4223 rules applied. Total rules applied 4224 place count 18136 transition count 24188
Reduce places removed 4223 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4224 rules applied. Total rules applied 8448 place count 13913 transition count 24187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8449 place count 13912 transition count 24187
Performed 264 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 264 Pre rules applied. Total rules applied 8449 place count 13912 transition count 23923
Deduced a syphon composed of 264 places in 24 ms
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 3 with 528 rules applied. Total rules applied 8977 place count 13648 transition count 23923
Discarding 3959 places :
Symmetric choice reduction at 3 with 3959 rule applications. Total rules 12936 place count 9689 transition count 19964
Iterating global reduction 3 with 3959 rules applied. Total rules applied 16895 place count 9689 transition count 19964
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16895 place count 9689 transition count 19957
Deduced a syphon composed of 7 places in 27 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 16909 place count 9682 transition count 19957
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 17898 place count 8693 transition count 16001
Iterating global reduction 3 with 989 rules applied. Total rules applied 18887 place count 8693 transition count 16001
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 18953 place count 8660 transition count 15968
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 3 with 577 rules applied. Total rules applied 19530 place count 8660 transition count 18358
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 3 with 577 rules applied. Total rules applied 20107 place count 8083 transition count 18358
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 20140 place count 8083 transition count 18358
Applied a total of 20140 rules in 15183 ms. Remains 8083 /18180 variables (removed 10097) and now considering 18358/28411 (removed 10053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15188 ms. Remains : 8083/18180 places, 18358/28411 transitions.
Normalized transition count is 16792 out of 18358 initially.
// Phase 1: matrix 16792 rows 8083 cols
[2023-03-13 16:16:08] [INFO ] Computed 1429 place invariants in 925 ms
Interrupted random walk after 670342 steps, including 26670 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 1
Interrupted Best-First random walk after 955784 steps, including 3499 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
Interrupted Best-First random walk after 956310 steps, including 3501 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
Interrupted Best-First random walk after 950984 steps, including 3481 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen 1
Interrupted Best-First random walk after 957254 steps, including 3504 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
Interrupted Best-First random walk after 959787 steps, including 3513 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
Interrupted Best-First random walk after 959229 steps, including 3511 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
Interrupted Best-First random walk after 956439 steps, including 3501 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
Interrupted Best-First random walk after 955505 steps, including 3498 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 1
[2023-03-13 16:17:18] [INFO ] Flow matrix only has 16792 transitions (discarded 1566 similar events)
// Phase 1: matrix 16792 rows 8083 cols
[2023-03-13 16:17:19] [INFO ] Computed 1429 place invariants in 838 ms
[2023-03-13 16:17:20] [INFO ] [Real]Absence check using 65 positive place invariants in 179 ms returned sat
[2023-03-13 16:17:20] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 470 ms returned sat
[2023-03-13 16:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:17:31] [INFO ] [Real]Absence check using state equation in 10424 ms returned sat
[2023-03-13 16:17:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:17:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-13 16:17:33] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 453 ms returned sat
[2023-03-13 16:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:17:43] [INFO ] [Nat]Absence check using state equation in 10639 ms returned sat
[2023-03-13 16:17:43] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2023-03-13 16:17:44] [INFO ] [Nat]Added 9154 Read/Feed constraints in 1085 ms returned unsat
[2023-03-13 16:17:45] [INFO ] [Real]Absence check using 65 positive place invariants in 184 ms returned sat
[2023-03-13 16:17:46] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 506 ms returned sat
[2023-03-13 16:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:17:59] [INFO ] [Real]Absence check using state equation in 12793 ms returned sat
[2023-03-13 16:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:18:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-13 16:18:01] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 469 ms returned sat
[2023-03-13 16:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:18:13] [INFO ] [Nat]Absence check using state equation in 12148 ms returned sat
[2023-03-13 16:18:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 16:18:17] [INFO ] [Nat]Added 9154 Read/Feed constraints in 4242 ms returned unsat
[2023-03-13 16:18:18] [INFO ] [Real]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-13 16:18:18] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 473 ms returned sat
[2023-03-13 16:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:18:29] [INFO ] [Real]Absence check using state equation in 10919 ms returned sat
[2023-03-13 16:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:18:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-13 16:18:31] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 481 ms returned sat
[2023-03-13 16:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:18:42] [INFO ] [Nat]Absence check using state equation in 11148 ms returned sat
[2023-03-13 16:18:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 16:18:49] [INFO ] [Nat]Added 9154 Read/Feed constraints in 6489 ms returned unknown
[2023-03-13 16:18:50] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2023-03-13 16:18:50] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 470 ms returned sat
[2023-03-13 16:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:19:01] [INFO ] [Real]Absence check using state equation in 11093 ms returned sat
[2023-03-13 16:19:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:19:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-13 16:19:03] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 474 ms returned sat
[2023-03-13 16:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:19:14] [INFO ] [Nat]Absence check using state equation in 10917 ms returned sat
[2023-03-13 16:19:15] [INFO ] [Nat]Added 9154 Read/Feed constraints in 996 ms returned unsat
[2023-03-13 16:19:16] [INFO ] [Real]Absence check using 65 positive place invariants in 169 ms returned sat
[2023-03-13 16:19:16] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 466 ms returned sat
[2023-03-13 16:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:19:26] [INFO ] [Real]Absence check using state equation in 10198 ms returned sat
[2023-03-13 16:19:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:19:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 161 ms returned sat
[2023-03-13 16:19:28] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 454 ms returned sat
[2023-03-13 16:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:19:39] [INFO ] [Nat]Absence check using state equation in 10509 ms returned sat
[2023-03-13 16:19:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 16:19:42] [INFO ] [Nat]Added 9154 Read/Feed constraints in 3623 ms returned unsat
[2023-03-13 16:19:43] [INFO ] [Real]Absence check using 65 positive place invariants in 168 ms returned sat
[2023-03-13 16:19:44] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 469 ms returned sat
[2023-03-13 16:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:19:55] [INFO ] [Real]Absence check using state equation in 10803 ms returned sat
[2023-03-13 16:19:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:19:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-13 16:19:56] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 462 ms returned sat
[2023-03-13 16:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:20:07] [INFO ] [Nat]Absence check using state equation in 10605 ms returned sat
[2023-03-13 16:20:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 16:20:11] [INFO ] [Nat]Added 9154 Read/Feed constraints in 4128 ms returned unsat
[2023-03-13 16:20:12] [INFO ] [Real]Absence check using 65 positive place invariants in 163 ms returned sat
[2023-03-13 16:20:12] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 453 ms returned sat
[2023-03-13 16:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:20:23] [INFO ] [Real]Absence check using state equation in 10938 ms returned sat
[2023-03-13 16:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:20:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 165 ms returned sat
[2023-03-13 16:20:25] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 447 ms returned sat
[2023-03-13 16:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:20:36] [INFO ] [Nat]Absence check using state equation in 11348 ms returned sat
[2023-03-13 16:20:39] [INFO ] [Nat]Added 9154 Read/Feed constraints in 2860 ms returned unsat
[2023-03-13 16:20:40] [INFO ] [Real]Absence check using 65 positive place invariants in 161 ms returned sat
[2023-03-13 16:20:40] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 177 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 1, 0, 0, 0, 0, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 8083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8083/8083 places, 18358/18358 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8083 transition count 18357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8082 transition count 18357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 8081 transition count 18356
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 8081 transition count 18356
Applied a total of 4 rules in 5946 ms. Remains 8081 /8083 variables (removed 2) and now considering 18356/18358 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5946 ms. Remains : 8081/8083 places, 18356/18358 transitions.
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-13 16:20:47] [INFO ] Computed 1429 place invariants in 829 ms
Interrupted random walk after 678359 steps, including 26992 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 0
Interrupted Best-First random walk after 960083 steps, including 3515 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
[2023-03-13 16:21:22] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-13 16:21:23] [INFO ] Computed 1429 place invariants in 896 ms
[2023-03-13 16:21:24] [INFO ] [Real]Absence check using 65 positive place invariants in 161 ms returned sat
[2023-03-13 16:21:24] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 462 ms returned sat
[2023-03-13 16:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:21:34] [INFO ] [Real]Absence check using state equation in 9865 ms returned sat
[2023-03-13 16:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:21:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 170 ms returned sat
[2023-03-13 16:21:36] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 465 ms returned sat
[2023-03-13 16:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:21:47] [INFO ] [Nat]Absence check using state equation in 10699 ms returned sat
[2023-03-13 16:21:47] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2023-03-13 16:21:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 16:21:52] [INFO ] [Nat]Added 9154 Read/Feed constraints in 4901 ms returned sat
[2023-03-13 16:22:05] [INFO ] Deduced a trap composed of 546 places in 13324 ms of which 16 ms to minimize.
[2023-03-13 16:22:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14357 ms
[2023-03-13 16:22:07] [INFO ] Computed and/alt/rep : 10922/15882/10922 causal constraints (skipped 5835 transitions) in 1286 ms.
[2023-03-13 16:22:10] [INFO ] Added : 6 causal constraints over 2 iterations in 4590 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2325 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2327 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2189 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
[2023-03-13 16:22:16] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-13 16:22:16] [INFO ] Invariant cache hit.
[2023-03-13 16:22:16] [INFO ] Implicit Places using invariants in 721 ms returned []
Implicit Place search using SMT only with invariants took 725 ms to find 0 implicit places.
[2023-03-13 16:22:16] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-13 16:22:16] [INFO ] Invariant cache hit.
[2023-03-13 16:22:29] [INFO ] Dead Transitions using invariants and state equation in 12389 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15311 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-13 16:22:30] [INFO ] Computed 1429 place invariants in 808 ms
Incomplete random walk after 10000 steps, including 397 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
[2023-03-13 16:22:30] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-13 16:22:31] [INFO ] Computed 1429 place invariants in 826 ms
[2023-03-13 16:22:32] [INFO ] [Real]Absence check using 65 positive place invariants in 166 ms returned sat
[2023-03-13 16:22:32] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 462 ms returned sat
[2023-03-13 16:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:22:36] [INFO ] [Real]Absence check using state equation in 3726 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2152 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2153 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Normalized transition count is 16790 out of 18356 initially.
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-13 16:22:39] [INFO ] Computed 1429 place invariants in 917 ms
Interrupted random walk after 677261 steps, including 26953 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen 0
Interrupted Best-First random walk after 965246 steps, including 3533 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 0
[2023-03-13 16:23:14] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
// Phase 1: matrix 16790 rows 8081 cols
[2023-03-13 16:23:15] [INFO ] Computed 1429 place invariants in 834 ms
[2023-03-13 16:23:16] [INFO ] [Real]Absence check using 65 positive place invariants in 159 ms returned sat
[2023-03-13 16:23:16] [INFO ] [Real]Absence check using 65 positive and 1364 generalized place invariants in 465 ms returned sat
[2023-03-13 16:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:23:26] [INFO ] [Real]Absence check using state equation in 9738 ms returned sat
[2023-03-13 16:23:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:23:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 163 ms returned sat
[2023-03-13 16:23:28] [INFO ] [Nat]Absence check using 65 positive and 1364 generalized place invariants in 457 ms returned sat
[2023-03-13 16:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:23:38] [INFO ] [Nat]Absence check using state equation in 10673 ms returned sat
[2023-03-13 16:23:39] [INFO ] State equation strengthened by 9154 read => feed constraints.
[2023-03-13 16:23:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 16:23:43] [INFO ] [Nat]Added 9154 Read/Feed constraints in 4922 ms returned sat
[2023-03-13 16:23:57] [INFO ] Deduced a trap composed of 546 places in 13281 ms of which 9 ms to minimize.
[2023-03-13 16:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14258 ms
[2023-03-13 16:23:59] [INFO ] Computed and/alt/rep : 10922/15882/10922 causal constraints (skipped 5835 transitions) in 1348 ms.
[2023-03-13 16:24:02] [INFO ] Added : 6 causal constraints over 2 iterations in 4077 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2199 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2199 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8081/8081 places, 18356/18356 transitions.
Applied a total of 0 rules in 2193 ms. Remains 8081 /8081 variables (removed 0) and now considering 18356/18356 (removed 0) transitions.
[2023-03-13 16:24:07] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-13 16:24:07] [INFO ] Invariant cache hit.
[2023-03-13 16:24:15] [INFO ] Implicit Places using invariants in 8114 ms returned []
Implicit Place search using SMT only with invariants took 8116 ms to find 0 implicit places.
[2023-03-13 16:24:15] [INFO ] Flow matrix only has 16790 transitions (discarded 1566 similar events)
[2023-03-13 16:24:15] [INFO ] Invariant cache hit.
[2023-03-13 16:24:28] [INFO ] Dead Transitions using invariants and state equation in 13101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23414 ms. Remains : 8081/8081 places, 18356/18356 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C04-UpperBounds-06 in 119243 ms.
[2023-03-13 16:24:29] [INFO ] Flatten gal took : 1008 ms
[2023-03-13 16:24:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 16:24:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8081 places, 18356 transitions and 102138 arcs took 80 ms.
Total runtime 589455 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S32C04
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 8081 places, 18356 transitions, 102138 arcs.
Final Score: 5.472482197E7
Took : 335 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15149988 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16053484 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C04.tgz
mv MultiCrashLeafsetExtension-PT-S32C04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;