About the Execution of LTSMin+red for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2346.552 | 3600000.00 | 13961565.00 | 808.20 | 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/mcc2023-input.r521-tall-167987246400277.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 ltsminxred
Input is EisenbergMcGuire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 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 EisenbergMcGuire-PT-10-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1680853090065
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 07:38:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 07:38:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:38:14] [INFO ] Load time of PNML (sax parser for PT used): 441 ms
[2023-04-07 07:38:14] [INFO ] Transformed 1090 places.
[2023-04-07 07:38:14] [INFO ] Transformed 5200 transitions.
[2023-04-07 07:38:14] [INFO ] Found NUPN structural information;
[2023-04-07 07:38:14] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 642 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 2330 out of 5200 initially.
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 07:38:15] [INFO ] Computed 31 invariants in 105 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 16) seen :9
FORMULA EisenbergMcGuire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
[2023-04-07 07:38:15] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 07:38:15] [INFO ] Computed 31 invariants in 11 ms
[2023-04-07 07:38:16] [INFO ] [Real]Absence check using 21 positive place invariants in 42 ms returned sat
[2023-04-07 07:38:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:17] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2023-04-07 07:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 07:38:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 07:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:18] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2023-04-07 07:38:18] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-07 07:38:19] [INFO ] [Nat]Added 1246 Read/Feed constraints in 204 ms returned sat
[2023-04-07 07:38:20] [INFO ] Deduced a trap composed of 3 places in 1399 ms of which 5 ms to minimize.
[2023-04-07 07:38:21] [INFO ] Deduced a trap composed of 39 places in 1093 ms of which 1 ms to minimize.
[2023-04-07 07:38:22] [INFO ] Deduced a trap composed of 80 places in 876 ms of which 2 ms to minimize.
[2023-04-07 07:38:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 07:38:23] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 07:38:23] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:23] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2023-04-07 07:38:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 35 ms returned sat
[2023-04-07 07:38:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 38 ms returned sat
[2023-04-07 07:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:24] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2023-04-07 07:38:24] [INFO ] [Nat]Added 1246 Read/Feed constraints in 191 ms returned sat
[2023-04-07 07:38:29] [INFO ] Deduced a trap composed of 3 places in 4340 ms of which 2 ms to minimize.
[2023-04-07 07:38:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 07:38:29] [INFO ] [Real]Absence check using 21 positive place invariants in 29 ms returned sat
[2023-04-07 07:38:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 07:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:30] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2023-04-07 07:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 37 ms returned sat
[2023-04-07 07:38:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 07:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:31] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2023-04-07 07:38:31] [INFO ] [Nat]Added 1246 Read/Feed constraints in 168 ms returned sat
[2023-04-07 07:38:32] [INFO ] Deduced a trap composed of 3 places in 724 ms of which 2 ms to minimize.
[2023-04-07 07:38:33] [INFO ] Deduced a trap composed of 3 places in 515 ms of which 0 ms to minimize.
[2023-04-07 07:38:33] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2023-04-07 07:38:34] [INFO ] Deduced a trap composed of 134 places in 732 ms of which 1 ms to minimize.
[2023-04-07 07:38:35] [INFO ] Deduced a trap composed of 50 places in 625 ms of which 2 ms to minimize.
[2023-04-07 07:38:35] [INFO ] Deduced a trap composed of 90 places in 501 ms of which 0 ms to minimize.
[2023-04-07 07:38: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: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 07:38:36] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2023-04-07 07:38:36] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 07:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:36] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2023-04-07 07:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 07:38:36] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:37] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-04-07 07:38:37] [INFO ] [Nat]Added 1246 Read/Feed constraints in 198 ms returned sat
[2023-04-07 07:38:38] [INFO ] Deduced a trap composed of 3 places in 768 ms of which 1 ms to minimize.
[2023-04-07 07:38:39] [INFO ] Deduced a trap composed of 50 places in 678 ms of which 1 ms to minimize.
[2023-04-07 07:38:39] [INFO ] Deduced a trap composed of 35 places in 702 ms of which 1 ms to minimize.
[2023-04-07 07:38:40] [INFO ] Deduced a trap composed of 3 places in 459 ms of which 1 ms to minimize.
[2023-04-07 07:38:41] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 1 ms to minimize.
[2023-04-07 07:38:41] [INFO ] Deduced a trap composed of 41 places in 429 ms of which 1 ms to minimize.
[2023-04-07 07:38:41] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 4094 ms
[2023-04-07 07:38:41] [INFO ] [Real]Absence check using 21 positive place invariants in 26 ms returned sat
[2023-04-07 07:38:41] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:42] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-04-07 07:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 07:38:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:43] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2023-04-07 07:38:43] [INFO ] [Nat]Added 1246 Read/Feed constraints in 198 ms returned sat
[2023-04-07 07:38:44] [INFO ] Deduced a trap composed of 3 places in 564 ms of which 1 ms to minimize.
[2023-04-07 07:38:44] [INFO ] Deduced a trap composed of 64 places in 610 ms of which 1 ms to minimize.
[2023-04-07 07:38:45] [INFO ] Deduced a trap composed of 4 places in 577 ms of which 1 ms to minimize.
[2023-04-07 07:38:46] [INFO ] Deduced a trap composed of 3 places in 710 ms of which 1 ms to minimize.
[2023-04-07 07:38:46] [INFO ] Deduced a trap composed of 50 places in 516 ms of which 1 ms to minimize.
[2023-04-07 07:38:47] [INFO ] Deduced a trap composed of 3 places in 691 ms of which 1 ms to minimize.
[2023-04-07 07:38:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 07:38:47] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 07:38:47] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:48] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2023-04-07 07:38:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 126 ms returned sat
[2023-04-07 07:38:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 100 ms returned sat
[2023-04-07 07:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 07:38:53] [INFO ] [Real]Absence check using 21 positive place invariants in 31 ms returned sat
[2023-04-07 07:38:53] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 23 ms returned sat
[2023-04-07 07:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:54] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2023-04-07 07:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:38:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-07 07:38:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 07:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:38:56] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-04-07 07:38:56] [INFO ] [Nat]Added 1246 Read/Feed constraints in 261 ms returned sat
[2023-04-07 07:38:57] [INFO ] Deduced a trap composed of 3 places in 553 ms of which 1 ms to minimize.
[2023-04-07 07:38:57] [INFO ] Deduced a trap composed of 3 places in 519 ms of which 0 ms to minimize.
[2023-04-07 07:38:58] [INFO ] Deduced a trap composed of 51 places in 798 ms of which 2 ms to minimize.
[2023-04-07 07:38:59] [INFO ] Deduced a trap composed of 45 places in 728 ms of which 1 ms to minimize.
[2023-04-07 07:39:00] [INFO ] Deduced a trap composed of 3 places in 571 ms of which 1 ms to minimize.
[2023-04-07 07:39:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 1080 transition count 4882
Deduced a syphon composed of 308 places in 22 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 772 transition count 4882
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 726 place count 682 transition count 3982
Iterating global reduction 2 with 90 rules applied. Total rules applied 816 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 994 place count 593 transition count 3893
Applied a total of 994 rules in 1249 ms. Remains 593 /1090 variables (removed 497) and now considering 3893/5200 (removed 1307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 593/1090 places, 3893/5200 transitions.
Normalized transition count is 1023 out of 3893 initially.
// Phase 1: matrix 1023 rows 593 cols
[2023-04-07 07:39:01] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2928 ms. (steps per millisecond=341 ) properties (out of 5) seen :1
FORMULA EisenbergMcGuire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties (out of 4) seen :0
[2023-04-07 07:39:06] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2023-04-07 07:39:06] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 07:39:07] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 07:39:07] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2023-04-07 07:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:07] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2023-04-07 07:39:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 07:39:07] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:07] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-04-07 07:39:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:39:07] [INFO ] [Nat]Added 436 Read/Feed constraints in 97 ms returned sat
[2023-04-07 07:39:07] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-07 07:39:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-04-07 07:39:08] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 171 ms.
[2023-04-07 07:39:09] [INFO ] Added : 68 causal constraints over 14 iterations in 1315 ms. Result :sat
Minimization took 141 ms.
[2023-04-07 07:39:09] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:39:09] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:09] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-04-07 07:39:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 07:39:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:10] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2023-04-07 07:39:10] [INFO ] [Nat]Added 436 Read/Feed constraints in 61 ms returned sat
[2023-04-07 07:39:10] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-07 07:39:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-04-07 07:39:10] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 172 ms.
[2023-04-07 07:39:13] [INFO ] Deduced a trap composed of 27 places in 1719 ms of which 32 ms to minimize.
[2023-04-07 07:39:13] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2023-04-07 07:39:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2032 ms
[2023-04-07 07:39:14] [INFO ] Added : 98 causal constraints over 20 iterations in 3458 ms. Result :sat
Minimization took 130 ms.
[2023-04-07 07:39:14] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:39:14] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:15] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2023-04-07 07:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-07 07:39:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:15] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-04-07 07:39:15] [INFO ] [Nat]Added 436 Read/Feed constraints in 62 ms returned sat
[2023-04-07 07:39:15] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-04-07 07:39:16] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-07 07:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2023-04-07 07:39:16] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 137 ms.
[2023-04-07 07:39:16] [INFO ] Added : 43 causal constraints over 9 iterations in 669 ms. Result :sat
Minimization took 113 ms.
[2023-04-07 07:39:17] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-07 07:39:17] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:17] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-04-07 07:39:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2023-04-07 07:39:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 07:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:18] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2023-04-07 07:39:18] [INFO ] [Nat]Added 436 Read/Feed constraints in 85 ms returned sat
[2023-04-07 07:39:18] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-07 07:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-07 07:39:18] [INFO ] Computed and/alt/rep : 873/1973/603 causal constraints (skipped 410 transitions) in 137 ms.
[2023-04-07 07:39:19] [INFO ] Added : 58 causal constraints over 12 iterations in 971 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3893/3893 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 592 transition count 3892
Applied a total of 2 rules in 235 ms. Remains 592 /593 variables (removed 1) and now considering 3892/3893 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 592/593 places, 3892/3893 transitions.
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:39:20] [INFO ] Computed 31 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2505 ms. (steps per millisecond=399 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 3) seen :0
[2023-04-07 07:39:24] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:39:24] [INFO ] Computed 31 invariants in 13 ms
[2023-04-07 07:39:24] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:39:24] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:25] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-04-07 07:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 07:39:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:25] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2023-04-07 07:39:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:39:25] [INFO ] [Nat]Added 436 Read/Feed constraints in 72 ms returned sat
[2023-04-07 07:39:25] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 4 ms to minimize.
[2023-04-07 07:39:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-07 07:39:25] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 149 ms.
[2023-04-07 07:39:26] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-07 07:39:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 07:39:27] [INFO ] Added : 65 causal constraints over 14 iterations in 1294 ms. Result :sat
Minimization took 116 ms.
[2023-04-07 07:39:27] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 07:39:27] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:27] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-04-07 07:39:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 43 ms returned sat
[2023-04-07 07:39:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:28] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-04-07 07:39:28] [INFO ] [Nat]Added 436 Read/Feed constraints in 64 ms returned sat
[2023-04-07 07:39:28] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 87 ms.
[2023-04-07 07:39:29] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-07 07:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-04-07 07:39:29] [INFO ] Added : 60 causal constraints over 13 iterations in 1014 ms. Result :sat
Minimization took 117 ms.
[2023-04-07 07:39:29] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-04-07 07:39:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 07:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:29] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-04-07 07:39:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:39:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:39:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:30] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-04-07 07:39:30] [INFO ] [Nat]Added 436 Read/Feed constraints in 56 ms returned sat
[2023-04-07 07:39:30] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 142 ms.
[2023-04-07 07:39:31] [INFO ] Added : 53 causal constraints over 11 iterations in 729 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 141 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 592/592 places, 3892/3892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 253 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
[2023-04-07 07:39:32] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-07 07:39:32] [INFO ] Invariant cache hit.
[2023-04-07 07:39:33] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-04-07 07:39:33] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-07 07:39:33] [INFO ] Invariant cache hit.
[2023-04-07 07:39:33] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:39:38] [INFO ] Implicit Places using invariants and state equation in 4780 ms returned []
Implicit Place search using SMT with State Equation took 5755 ms to find 0 implicit places.
[2023-04-07 07:39:38] [INFO ] Redundant transitions in 232 ms returned []
[2023-04-07 07:39:38] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-07 07:39:38] [INFO ] Invariant cache hit.
[2023-04-07 07:39:40] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8141 ms. Remains : 592/592 places, 3892/3892 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:39:40] [INFO ] Computed 31 invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 07:39:40] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:39:40] [INFO ] Computed 31 invariants in 3 ms
[2023-04-07 07:39:40] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:39:40] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 07:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:40] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-04-07 07:39:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 07:39:40] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:41] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2023-04-07 07:39:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:39:41] [INFO ] [Nat]Added 436 Read/Feed constraints in 115 ms returned sat
[2023-04-07 07:39:41] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 07:39:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-04-07 07:39:41] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 155 ms.
[2023-04-07 07:39:42] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2023-04-07 07:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-04-07 07:39:43] [INFO ] Added : 65 causal constraints over 14 iterations in 1748 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 592 transition count 3890
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 590 transition count 3890
Applied a total of 4 rules in 318 ms. Remains 590 /592 variables (removed 2) and now considering 3890/3892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 590/592 places, 3890/3892 transitions.
Normalized transition count is 1020 out of 3890 initially.
// Phase 1: matrix 1020 rows 590 cols
[2023-04-07 07:39:43] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2570 ms. (steps per millisecond=389 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
[2023-04-07 07:39:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-07 07:39:47] [INFO ] Computed 31 invariants in 2 ms
[2023-04-07 07:39:47] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 07:39:47] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:47] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-04-07 07:39:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:39:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:39:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:39:47] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-04-07 07:39:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:39:47] [INFO ] [Nat]Added 436 Read/Feed constraints in 61 ms returned sat
[2023-04-07 07:39:47] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 07:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-07 07:39:47] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 410 transitions) in 93 ms.
[2023-04-07 07:39:48] [INFO ] Added : 56 causal constraints over 12 iterations in 728 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 141 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 140 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-07 07:39:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 07:39:49] [INFO ] Invariant cache hit.
[2023-04-07 07:39:49] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-04-07 07:39:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 07:39:49] [INFO ] Invariant cache hit.
[2023-04-07 07:39:50] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:39:53] [INFO ] Implicit Places using invariants and state equation in 3749 ms returned []
Implicit Place search using SMT with State Equation took 4366 ms to find 0 implicit places.
[2023-04-07 07:39:53] [INFO ] Redundant transitions in 224 ms returned []
[2023-04-07 07:39:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 07:39:53] [INFO ] Invariant cache hit.
[2023-04-07 07:39:59] [INFO ] Dead Transitions using invariants and state equation in 6042 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10802 ms. Remains : 590/590 places, 3890/3890 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01 in 19671 ms.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-03
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:39:59] [INFO ] Computed 31 invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 07:40:00] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:40:00] [INFO ] Computed 31 invariants in 3 ms
[2023-04-07 07:40:00] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-04-07 07:40:00] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 50 ms returned sat
[2023-04-07 07:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:00] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2023-04-07 07:40:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:40:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 40 ms returned sat
[2023-04-07 07:40:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 07:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:01] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-04-07 07:40:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:40:01] [INFO ] [Nat]Added 436 Read/Feed constraints in 67 ms returned sat
[2023-04-07 07:40:01] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 144 ms.
[2023-04-07 07:40:02] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-07 07:40:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-04-07 07:40:02] [INFO ] Added : 60 causal constraints over 13 iterations in 1154 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 592 transition count 3891
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 3891
Applied a total of 2 rules in 143 ms. Remains 591 /592 variables (removed 1) and now considering 3891/3892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 591/592 places, 3891/3892 transitions.
Normalized transition count is 1021 out of 3891 initially.
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:40:03] [INFO ] Computed 31 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2423 ms. (steps per millisecond=412 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
[2023-04-07 07:40:06] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:40:06] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 07:40:06] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:40:06] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-07 07:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:06] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-04-07 07:40:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:40:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 07:40:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 07:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:06] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-04-07 07:40:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:40:06] [INFO ] [Nat]Added 436 Read/Feed constraints in 63 ms returned sat
[2023-04-07 07:40:07] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 108 ms.
[2023-04-07 07:40:07] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 0 ms to minimize.
[2023-04-07 07:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-04-07 07:40:08] [INFO ] Added : 78 causal constraints over 16 iterations in 1216 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 137 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 136 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2023-04-07 07:40:08] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:40:08] [INFO ] Invariant cache hit.
[2023-04-07 07:40:09] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-04-07 07:40:09] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:40:09] [INFO ] Invariant cache hit.
[2023-04-07 07:40:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:40:12] [INFO ] Implicit Places using invariants and state equation in 3344 ms returned []
Implicit Place search using SMT with State Equation took 4013 ms to find 0 implicit places.
[2023-04-07 07:40:13] [INFO ] Redundant transitions in 123 ms returned []
[2023-04-07 07:40:13] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:40:13] [INFO ] Invariant cache hit.
[2023-04-07 07:40:14] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5538 ms. Remains : 591/591 places, 3891/3891 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-03 in 14337 ms.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-12
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:40:14] [INFO ] Computed 31 invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-07 07:40:14] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 07:40:14] [INFO ] Computed 31 invariants in 3 ms
[2023-04-07 07:40:14] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 07:40:14] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:14] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-04-07 07:40:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:40:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 07:40:14] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:14] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-04-07 07:40:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:40:14] [INFO ] [Nat]Added 436 Read/Feed constraints in 61 ms returned sat
[2023-04-07 07:40:15] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 89 ms.
[2023-04-07 07:40:16] [INFO ] Added : 53 causal constraints over 11 iterations in 1086 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 592 transition count 3891
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 3891
Applied a total of 2 rules in 145 ms. Remains 591 /592 variables (removed 1) and now considering 3891/3892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 591/592 places, 3891/3892 transitions.
Normalized transition count is 1021 out of 3891 initially.
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:40:16] [INFO ] Computed 31 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2538 ms. (steps per millisecond=394 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
[2023-04-07 07:40:19] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 07:40:19] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 07:40:19] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 07:40:19] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 07:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:20] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-04-07 07:40:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 07:40:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2023-04-07 07:40:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 07:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 07:40:20] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-04-07 07:40:20] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:40:20] [INFO ] [Nat]Added 436 Read/Feed constraints in 99 ms returned sat
[2023-04-07 07:40:20] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 144 ms.
[2023-04-07 07:40:21] [INFO ] Added : 70 causal constraints over 14 iterations in 1166 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 129 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 127 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2023-04-07 07:40:22] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:40:22] [INFO ] Invariant cache hit.
[2023-04-07 07:40:23] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-04-07 07:40:23] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:40:23] [INFO ] Invariant cache hit.
[2023-04-07 07:40:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 07:40:27] [INFO ] Implicit Places using invariants and state equation in 4236 ms returned []
Implicit Place search using SMT with State Equation took 4893 ms to find 0 implicit places.
[2023-04-07 07:40:27] [INFO ] Redundant transitions in 115 ms returned []
[2023-04-07 07:40:27] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 07:40:27] [INFO ] Invariant cache hit.
[2023-04-07 07:40:28] [INFO ] Dead Transitions using invariants and state equation in 1199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6369 ms. Remains : 591/591 places, 3891/3891 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-12 in 14602 ms.
[2023-04-07 07:40:29] [INFO ] Flatten gal took : 317 ms
[2023-04-07 07:40:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 07:40:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 592 places, 3892 transitions and 20984 arcs took 23 ms.
Total runtime 135385 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/789/ub_0_ --maxsum=/tmp/789/ub_1_ --maxsum=/tmp/789/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15283204 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096716 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is EisenbergMcGuire-PT-10, 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 r521-tall-167987246400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;