About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S24C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11367.016 | 3600000.00 | 7159225.00 | 7863.60 | 1 1 1 1 0 0 1 0 ? 1 1 0 0 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/mcc2024-input.r245-tall-171654349200093.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S24C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349200093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 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-S24C06-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716594108110
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 23:41:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 23:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 23:41:50] [INFO ] Load time of PNML (sax parser for PT used): 677 ms
[2024-05-24 23:41:50] [INFO ] Transformed 12464 places.
[2024-05-24 23:41:50] [INFO ] Transformed 18463 transitions.
[2024-05-24 23:41:50] [INFO ] Parsed PT model containing 12464 places and 18463 transitions and 71462 arcs in 895 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 23:41:50] [INFO ] Flow matrix only has 17863 transitions (discarded 600 similar events)
// Phase 1: matrix 17863 rows 12464 cols
[2024-05-24 23:41:52] [INFO ] Computed 1029 invariants in 1476 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[75, 75, 25, 25, 1, 1, 25, 1, 1, 25, 1, 1, 1, 75, 25, 25]
RANDOM walk for 10000 steps (161 resets) in 283 ms. (35 steps per ms)
BEST_FIRST walk for 160012 steps (480 resets) in 761 ms. (209 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1] Max Struct:[75, 75, 25, 25, 1, 1, 25, 1, 1, 25, 1, 1, 1, 75, 25, 25]
[2024-05-24 23:41:53] [INFO ] Flow matrix only has 17863 transitions (discarded 600 similar events)
[2024-05-24 23:41:53] [INFO ] Invariant cache hit.
[2024-05-24 23:41:54] [INFO ] [Real]Absence check using 66 positive place invariants in 271 ms returned sat
[2024-05-24 23:41:55] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 442 ms returned sat
[2024-05-24 23:41:58] [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 0
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 23:41:59] [INFO ] [Real]Absence check using 66 positive place invariants in 256 ms returned sat
[2024-05-24 23:42:00] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 352 ms returned unsat
[2024-05-24 23:42:01] [INFO ] [Real]Absence check using 66 positive place invariants in 268 ms returned sat
[2024-05-24 23:42:02] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 418 ms returned sat
[2024-05-24 23:42:04] [INFO ] [Real]Absence check using state equation in 1915 ms returned sat
[2024-05-24 23:42:04] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:42:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:42:05] [INFO ] [Real]Added 5602 Read/Feed constraints in 347 ms returned unknown
[2024-05-24 23:42:06] [INFO ] [Real]Absence check using 66 positive place invariants in 249 ms returned sat
[2024-05-24 23:42:06] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 140 ms returned unsat
[2024-05-24 23:42:08] [INFO ] [Real]Absence check using 66 positive place invariants in 251 ms returned sat
[2024-05-24 23:42:08] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 437 ms returned sat
[2024-05-24 23:42:10] [INFO ] [Real]Absence check using state equation in 1827 ms returned sat
[2024-05-24 23:42:11] [INFO ] [Real]Added 5602 Read/Feed constraints in 319 ms returned sat
[2024-05-24 23:42:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:42:13] [INFO ] [Nat]Absence check using 66 positive place invariants in 258 ms returned sat
[2024-05-24 23:42:13] [INFO ] [Nat]Absence check using 66 positive and 963 generalized place invariants in 413 ms returned sat
[2024-05-24 23:42:16] [INFO ] [Nat]Absence check using state equation in 3216 ms returned unknown
[2024-05-24 23:42:18] [INFO ] [Real]Absence check using 66 positive place invariants in 250 ms returned sat
[2024-05-24 23:42:18] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 441 ms returned sat
[2024-05-24 23:42:21] [INFO ] [Real]Absence check using state equation in 2967 ms returned unknown
[2024-05-24 23:42:23] [INFO ] [Real]Absence check using 66 positive place invariants in 250 ms returned sat
[2024-05-24 23:42:23] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 136 ms returned unsat
[2024-05-24 23:42:24] [INFO ] [Real]Absence check using 66 positive place invariants in 245 ms returned sat
[2024-05-24 23:42:25] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 443 ms returned sat
[2024-05-24 23:42:28] [INFO ] [Real]Absence check using state equation in 3082 ms returned unknown
[2024-05-24 23:42:30] [INFO ] [Real]Absence check using 66 positive place invariants in 274 ms returned sat
[2024-05-24 23:42:30] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 438 ms returned sat
[2024-05-24 23:42:33] [INFO ] [Real]Absence check using state equation in 2980 ms returned unknown
[2024-05-24 23:42:34] [INFO ] [Real]Absence check using 66 positive place invariants in 247 ms returned sat
[2024-05-24 23:42:35] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 139 ms returned unsat
[2024-05-24 23:42:36] [INFO ] [Real]Absence check using 66 positive place invariants in 245 ms returned sat
[2024-05-24 23:42:37] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 441 ms returned sat
[2024-05-24 23:42:40] [INFO ] [Real]Absence check using state equation in 2975 ms returned unknown
[2024-05-24 23:42:41] [INFO ] [Real]Absence check using 66 positive place invariants in 244 ms returned sat
[2024-05-24 23:42:42] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 422 ms returned sat
[2024-05-24 23:42:45] [INFO ] [Real]Absence check using state equation in 3017 ms returned unknown
[2024-05-24 23:42:46] [INFO ] [Real]Absence check using 66 positive place invariants in 255 ms returned sat
[2024-05-24 23:42:47] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 478 ms returned sat
[2024-05-24 23:42:49] [INFO ] [Real]Absence check using state equation in 2060 ms returned sat
[2024-05-24 23:42:50] [INFO ] [Real]Added 5602 Read/Feed constraints in 388 ms returned sat
[2024-05-24 23:42:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:42:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 265 ms returned sat
[2024-05-24 23:42:52] [INFO ] [Nat]Absence check using 66 positive and 963 generalized place invariants in 475 ms returned sat
[2024-05-24 23:42:54] [INFO ] [Nat]Absence check using state equation in 2130 ms returned sat
[2024-05-24 23:42:54] [INFO ] [Nat]Added 5602 Read/Feed constraints in 389 ms returned sat
[2024-05-24 23:43:23] [INFO ] Deduced a trap composed of 74 places in 28484 ms of which 576 ms to minimize.
[2024-05-24 23:43:23] [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 12
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 23:43:25] [INFO ] [Real]Absence check using 66 positive place invariants in 281 ms returned sat
[2024-05-24 23:43:25] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 488 ms returned sat
[2024-05-24 23:43:27] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2024-05-24 23:43:28] [INFO ] [Real]Added 5602 Read/Feed constraints in 390 ms returned sat
[2024-05-24 23:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:43:30] [INFO ] [Nat]Absence check using 66 positive place invariants in 266 ms returned sat
[2024-05-24 23:43:30] [INFO ] [Nat]Absence check using 66 positive and 963 generalized place invariants in 452 ms returned sat
[2024-05-24 23:43:32] [INFO ] [Nat]Absence check using state equation in 1953 ms returned sat
[2024-05-24 23:43:32] [INFO ] [Nat]Added 5602 Read/Feed constraints in 356 ms returned sat
[2024-05-24 23:44:00] [INFO ] Deduced a trap composed of 1033 places in 27115 ms of which 77 ms to minimize.
[2024-05-24 23:44: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 13
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 23:44:01] [INFO ] [Real]Absence check using 66 positive place invariants in 244 ms returned sat
[2024-05-24 23:44:02] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 140 ms returned unsat
[2024-05-24 23:44:03] [INFO ] [Real]Absence check using 66 positive place invariants in 242 ms returned sat
[2024-05-24 23:44:03] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 138 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1] Max Struct:[75, 1, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 75, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[75, 25, 1, 1, 1, 1, 1, 1, 1, 75]
Support contains 10 out of 12464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12464/12464 places, 18463/18463 transitions.
Graph (complete) has 41533 edges and 12464 vertex of which 12424 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.40 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3597 transitions
Trivial Post-agglo rules discarded 3597 transitions
Performed 3597 trivial Post agglomeration. Transition count delta: 3597
Iterating post reduction 0 with 3597 rules applied. Total rules applied 3598 place count 12424 transition count 14866
Reduce places removed 3597 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3599 rules applied. Total rules applied 7197 place count 8827 transition count 14864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7199 place count 8825 transition count 14864
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 300 Pre rules applied. Total rules applied 7199 place count 8825 transition count 14564
Deduced a syphon composed of 300 places in 13 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 3 with 600 rules applied. Total rules applied 7799 place count 8525 transition count 14564
Discarding 3297 places :
Symmetric choice reduction at 3 with 3297 rule applications. Total rules 11096 place count 5228 transition count 11267
Iterating global reduction 3 with 3297 rules applied. Total rules applied 14393 place count 5228 transition count 11267
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 14393 place count 5228 transition count 11258
Deduced a syphon composed of 9 places in 20 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 14411 place count 5219 transition count 11258
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 14958 place count 4672 transition count 7976
Iterating global reduction 3 with 547 rules applied. Total rules applied 15505 place count 4672 transition count 7976
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 15555 place count 4647 transition count 7951
Free-agglomeration rule (complex) applied 339 times.
Iterating global reduction 3 with 339 rules applied. Total rules applied 15894 place count 4647 transition count 10347
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 3 with 339 rules applied. Total rules applied 16233 place count 4308 transition count 10347
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 16308 place count 4308 transition count 10347
Applied a total of 16308 rules in 5154 ms. Remains 4308 /12464 variables (removed 8156) and now considering 10347/18463 (removed 8116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5167 ms. Remains : 4308/12464 places, 10347/18463 transitions.
[2024-05-24 23:44:08] [INFO ] Flow matrix only has 9461 transitions (discarded 886 similar events)
// Phase 1: matrix 9461 rows 4308 cols
[2024-05-24 23:44:09] [INFO ] Computed 989 invariants in 250 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 1, 1, 1, 1, 1, 1, 2]
RANDOM walk for 837800 steps (22461 resets) in 30001 ms. (27 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8248870 steps (27372 resets) in 45009 ms. (183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[2, 1, 1, 1, 1, 1, 1, 1, 2]
[2024-05-24 23:45:24] [INFO ] Flow matrix only has 9461 transitions (discarded 886 similar events)
[2024-05-24 23:45:24] [INFO ] Invariant cache hit.
[2024-05-24 23:45:24] [INFO ] [Real]Absence check using 49 positive place invariants in 101 ms returned sat
[2024-05-24 23:45:24] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 38 ms returned unsat
[2024-05-24 23:45:25] [INFO ] [Real]Absence check using 49 positive place invariants in 115 ms returned sat
[2024-05-24 23:45:25] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 209 ms returned sat
[2024-05-24 23:45:31] [INFO ] [Real]Absence check using state equation in 5681 ms returned sat
[2024-05-24 23:45:31] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:45:34] [INFO ] [Real]Added 5602 Read/Feed constraints in 2645 ms returned sat
[2024-05-24 23:45:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:45:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 101 ms returned sat
[2024-05-24 23:45:35] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 206 ms returned sat
[2024-05-24 23:45:41] [INFO ] [Nat]Absence check using state equation in 5956 ms returned sat
[2024-05-24 23:45:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:45:50] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9323 ms returned unknown
[2024-05-24 23:45:51] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:45:51] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 204 ms returned sat
[2024-05-24 23:45:54] [INFO ] [Real]Absence check using state equation in 3680 ms returned sat
[2024-05-24 23:45:56] [INFO ] [Real]Added 5602 Read/Feed constraints in 1058 ms returned unsat
[2024-05-24 23:45:56] [INFO ] [Real]Absence check using 49 positive place invariants in 100 ms returned sat
[2024-05-24 23:45:56] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 206 ms returned sat
[2024-05-24 23:46:01] [INFO ] [Real]Absence check using state equation in 4342 ms returned sat
[2024-05-24 23:46:03] [INFO ] [Real]Added 5602 Read/Feed constraints in 1521 ms returned sat
[2024-05-24 23:46:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:46:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 106 ms returned sat
[2024-05-24 23:46:04] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 219 ms returned sat
[2024-05-24 23:46:08] [INFO ] [Nat]Absence check using state equation in 4208 ms returned sat
[2024-05-24 23:46:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:46:17] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9344 ms returned unknown
[2024-05-24 23:46:18] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:46:18] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 204 ms returned sat
[2024-05-24 23:46:23] [INFO ] [Real]Absence check using state equation in 4745 ms returned sat
[2024-05-24 23:46:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:46:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-24 23:46:23] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 195 ms returned sat
[2024-05-24 23:46:28] [INFO ] [Nat]Absence check using state equation in 4797 ms returned sat
[2024-05-24 23:46:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:46:38] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9324 ms returned unknown
[2024-05-24 23:46:38] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-24 23:46:38] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 196 ms returned sat
[2024-05-24 23:46:43] [INFO ] [Real]Absence check using state equation in 4421 ms returned sat
[2024-05-24 23:46:45] [INFO ] [Real]Added 5602 Read/Feed constraints in 1592 ms returned sat
[2024-05-24 23:46:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:46:45] [INFO ] [Nat]Absence check using 49 positive place invariants in 97 ms returned sat
[2024-05-24 23:46:45] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 205 ms returned sat
[2024-05-24 23:46:50] [INFO ] [Nat]Absence check using state equation in 4518 ms returned sat
[2024-05-24 23:46:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:46:59] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9347 ms returned unknown
[2024-05-24 23:47:00] [INFO ] [Real]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-05-24 23:47:00] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 202 ms returned sat
[2024-05-24 23:47:04] [INFO ] [Real]Absence check using state equation in 4244 ms returned sat
[2024-05-24 23:47:06] [INFO ] [Real]Added 5602 Read/Feed constraints in 1894 ms returned unsat
[2024-05-24 23:47:07] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:47:07] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 203 ms returned sat
[2024-05-24 23:47:11] [INFO ] [Real]Absence check using state equation in 3940 ms returned sat
[2024-05-24 23:47:13] [INFO ] [Real]Added 5602 Read/Feed constraints in 1454 ms returned sat
[2024-05-24 23:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:47:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 101 ms returned sat
[2024-05-24 23:47:14] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 193 ms returned sat
[2024-05-24 23:47:18] [INFO ] [Nat]Absence check using state equation in 3896 ms returned sat
[2024-05-24 23:47:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:47:27] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9333 ms returned unknown
[2024-05-24 23:47:27] [INFO ] [Real]Absence check using 49 positive place invariants in 100 ms returned sat
[2024-05-24 23:47:28] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 68 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 0, 1, 1, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 4308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4308/4308 places, 10347/10347 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4308 transition count 10346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4307 transition count 10346
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 4307 transition count 10343
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 4304 transition count 10343
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 4301 transition count 10340
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 4301 transition count 10340
Applied a total of 14 rules in 1394 ms. Remains 4301 /4308 variables (removed 7) and now considering 10340/10347 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1394 ms. Remains : 4301/4308 places, 10340/10347 transitions.
[2024-05-24 23:47:29] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
// Phase 1: matrix 9454 rows 4301 cols
[2024-05-24 23:47:29] [INFO ] Computed 989 invariants in 328 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 855825 steps (22942 resets) in 30001 ms. (28 steps per ms)
BEST_FIRST walk for 4658053 steps (15457 resets) in 25010 ms. (186 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-24 23:48:24] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-24 23:48:24] [INFO ] Invariant cache hit.
[2024-05-24 23:48:25] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-24 23:48:25] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 201 ms returned sat
[2024-05-24 23:48:29] [INFO ] [Real]Absence check using state equation in 4365 ms returned sat
[2024-05-24 23:48:30] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:48:31] [INFO ] [Real]Added 5602 Read/Feed constraints in 1471 ms returned sat
[2024-05-24 23:48:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:48:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-05-24 23:48:32] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 183 ms returned sat
[2024-05-24 23:48:36] [INFO ] [Nat]Absence check using state equation in 4157 ms returned sat
[2024-05-24 23:48:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:48:46] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9347 ms returned unknown
[2024-05-24 23:48:46] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:48:46] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 207 ms returned sat
[2024-05-24 23:48:50] [INFO ] [Real]Absence check using state equation in 3316 ms returned sat
[2024-05-24 23:48:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:48:50] [INFO ] [Nat]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:48:51] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 206 ms returned sat
[2024-05-24 23:48:54] [INFO ] [Nat]Absence check using state equation in 3788 ms returned sat
[2024-05-24 23:48:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:49:03] [INFO ] [Nat]Added 5602 Read/Feed constraints in 8614 ms returned unsat
[2024-05-24 23:49:03] [INFO ] [Real]Absence check using 49 positive place invariants in 93 ms returned sat
[2024-05-24 23:49:04] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 209 ms returned sat
[2024-05-24 23:49:08] [INFO ] [Real]Absence check using state equation in 4297 ms returned sat
[2024-05-24 23:49:10] [INFO ] [Real]Added 5602 Read/Feed constraints in 1680 ms returned sat
[2024-05-24 23:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:49:11] [INFO ] [Nat]Absence check using 49 positive place invariants in 104 ms returned sat
[2024-05-24 23:49:11] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 218 ms returned sat
[2024-05-24 23:49:15] [INFO ] [Nat]Absence check using state equation in 4463 ms returned sat
[2024-05-24 23:49:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:49:25] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9391 ms returned unknown
[2024-05-24 23:49:25] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-24 23:49:25] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 205 ms returned sat
[2024-05-24 23:49:30] [INFO ] [Real]Absence check using state equation in 4178 ms returned sat
[2024-05-24 23:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:49:30] [INFO ] [Nat]Absence check using 49 positive place invariants in 101 ms returned sat
[2024-05-24 23:49:30] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 207 ms returned sat
[2024-05-24 23:49:36] [INFO ] [Nat]Absence check using state equation in 5847 ms returned sat
[2024-05-24 23:49:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:49:46] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9483 ms returned unknown
[2024-05-24 23:49:46] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:49:47] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 208 ms returned sat
[2024-05-24 23:49:51] [INFO ] [Real]Absence check using state equation in 4386 ms returned sat
[2024-05-24 23:49:52] [INFO ] [Real]Added 5602 Read/Feed constraints in 874 ms returned sat
[2024-05-24 23:49:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:49:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 99 ms returned sat
[2024-05-24 23:49:53] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 218 ms returned sat
[2024-05-24 23:49:59] [INFO ] [Nat]Absence check using state equation in 5713 ms returned sat
[2024-05-24 23:50:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:50:08] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9336 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 578 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 4301/4301 places, 10340/10340 transitions.
[2024-05-24 23:50:09] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-24 23:50:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 872616 steps (23395 resets) in 30001 ms. (29 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2874439 steps (9539 resets) in 15003 ms. (191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-24 23:50:54] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-24 23:50:54] [INFO ] Invariant cache hit.
[2024-05-24 23:50:54] [INFO ] [Real]Absence check using 49 positive place invariants in 100 ms returned sat
[2024-05-24 23:50:54] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 196 ms returned sat
[2024-05-24 23:50:59] [INFO ] [Real]Absence check using state equation in 4236 ms returned sat
[2024-05-24 23:50:59] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:51:00] [INFO ] [Real]Added 5602 Read/Feed constraints in 1384 ms returned sat
[2024-05-24 23:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:51:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 99 ms returned sat
[2024-05-24 23:51:01] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 198 ms returned sat
[2024-05-24 23:51:06] [INFO ] [Nat]Absence check using state equation in 4322 ms returned sat
[2024-05-24 23:51:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:51:15] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9350 ms returned unknown
[2024-05-24 23:51:15] [INFO ] [Real]Absence check using 49 positive place invariants in 96 ms returned sat
[2024-05-24 23:51:16] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 204 ms returned sat
[2024-05-24 23:51:20] [INFO ] [Real]Absence check using state equation in 4229 ms returned sat
[2024-05-24 23:51:22] [INFO ] [Real]Added 5602 Read/Feed constraints in 1571 ms returned sat
[2024-05-24 23:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:51:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 100 ms returned sat
[2024-05-24 23:51:23] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 199 ms returned sat
[2024-05-24 23:51:27] [INFO ] [Nat]Absence check using state equation in 4333 ms returned sat
[2024-05-24 23:51:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:51:36] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9356 ms returned unknown
[2024-05-24 23:51:37] [INFO ] [Real]Absence check using 49 positive place invariants in 97 ms returned sat
[2024-05-24 23:51:37] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 203 ms returned sat
[2024-05-24 23:51:42] [INFO ] [Real]Absence check using state equation in 4456 ms returned sat
[2024-05-24 23:51:43] [INFO ] [Real]Added 5602 Read/Feed constraints in 878 ms returned sat
[2024-05-24 23:51:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:51:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 98 ms returned sat
[2024-05-24 23:51:44] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 204 ms returned sat
[2024-05-24 23:51:49] [INFO ] [Nat]Absence check using state equation in 5415 ms returned sat
[2024-05-24 23:51:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:51:58] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9153 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 545 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 4301/4301 places, 10340/10340 transitions.
[2024-05-24 23:51:59] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-24 23:51:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 880093 steps (23596 resets) in 30001 ms. (29 steps per ms)
BEST_FIRST walk for 1906840 steps (6328 resets) in 10002 ms. (190 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 23:52:39] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-24 23:52:39] [INFO ] Invariant cache hit.
[2024-05-24 23:52:39] [INFO ] [Real]Absence check using 49 positive place invariants in 99 ms returned sat
[2024-05-24 23:52:39] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 188 ms returned sat
[2024-05-24 23:52:44] [INFO ] [Real]Absence check using state equation in 4022 ms returned sat
[2024-05-24 23:52:44] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:52:45] [INFO ] [Real]Added 5602 Read/Feed constraints in 1344 ms returned sat
[2024-05-24 23:52:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:52:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 94 ms returned sat
[2024-05-24 23:52:46] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 193 ms returned sat
[2024-05-24 23:52:50] [INFO ] [Nat]Absence check using state equation in 3895 ms returned sat
[2024-05-24 23:52:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:52:59] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9329 ms returned unknown
[2024-05-24 23:53:00] [INFO ] [Real]Absence check using 49 positive place invariants in 90 ms returned sat
[2024-05-24 23:53:00] [INFO ] [Real]Absence check using 49 positive and 940 generalized place invariants in 189 ms returned sat
[2024-05-24 23:53:04] [INFO ] [Real]Absence check using state equation in 3982 ms returned sat
[2024-05-24 23:53:06] [INFO ] [Real]Added 5602 Read/Feed constraints in 1441 ms returned sat
[2024-05-24 23:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:53:06] [INFO ] [Nat]Absence check using 49 positive place invariants in 92 ms returned sat
[2024-05-24 23:53:06] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 199 ms returned sat
[2024-05-24 23:53:11] [INFO ] [Nat]Absence check using state equation in 4187 ms returned sat
[2024-05-24 23:53:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:53:20] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9332 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 4301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 533 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 4301/4301 places, 10340/10340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4301/4301 places, 10340/10340 transitions.
Applied a total of 0 rules in 511 ms. Remains 4301 /4301 variables (removed 0) and now considering 10340/10340 (removed 0) transitions.
[2024-05-24 23:53:21] [INFO ] Flow matrix only has 9454 transitions (discarded 886 similar events)
[2024-05-24 23:53:21] [INFO ] Invariant cache hit.
[2024-05-24 23:53:35] [INFO ] Implicit Places using invariants in 13817 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 85, 103, 123, 145, 168, 190, 191, 192, 193, 194, 195, 196, 216, 234, 250, 264, 276, 286, 294, 300, 304, 306, 321, 327, 329, 330, 331, 332, 333, 334, 335, 337, 341, 347, 355, 365, 377, 391, 407, 425, 445, 466, 486, 487, 488, 489, 490, 491, 492, 510, 526, 540, 552, 562, 570, 576, 580, 582, 584, 599, 605, 607, 608, 609, 610, 611, 612, 613, 615, 617, 621, 627, 635, 645, 657, 671, 687, 705, 724, 742, 743, 744, 745, 746, 747, 748, 764, 778, 790, 800, 808, 814, 818, 820, 822, 824, 839, 845, 847, 848, 849, 850, 851, 852, 853, 855, 857, 859, 863, 869, 877, 887, 899, 913, 929, 946, 962, 963, 964, 965, 966, 967, 968, 982, 994, 1004, 1012, 1018, 1022, 1024, 1026, 1028, 1030, 1045, 1051, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1061, 1063, 1065, 1067, 1071, 1077, 1085, 1095, 1107, 1121, 1136, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1168, 1178, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1206, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1273, 1285, 1298, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1326, 1334, 1340, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1371, 1377, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1387, 1389, 1391, 1393, 1395, 1397, 1401, 1407, 1415, 1425, 1436, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1499, 1505, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1515, 1517, 1519, 1521, 1523, 1525, 1527, 1531, 1537, 1545, 1554, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1574, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1609, 1615, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1643, 1649, 1656, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1705, 1711, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1741, 1746, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1758, 1760, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1791, 1797, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1823, 1825, 1828, 1830, 1831, 1832, 1833, 1834, 1835, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1871, 1877, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1950, 1952, 1955, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1997, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2028, 2034, 2036, 2037, 2038, 2039, 2040, 2041, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2064, 2066, 2067, 2068, 2069, 2070, 2071, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2107, 2113, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2147, 2148, 2149, 2150, 2151, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2187, 2193, 2195, 2196, 2197, 2198, 2199, 2200, 2201, 2203, 2205, 2207, 2209, 2211, 2213, 2215, 2217, 2219, 2221, 2225, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2240, 2242, 2244, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2273, 2279, 2281, 2282, 2283, 2284, 2285, 2286, 2287, 2289, 2291, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2309, 2315, 2322, 2323, 2324, 2325, 2326, 2327, 2328, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2369, 2375, 2377, 2378, 2379, 2380, 2381, 2382, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2403, 2409, 2417, 2426, 2427, 2428, 2429, 2430, 2431, 2432, 2440, 2446, 2450, 2452, 2454, 2456, 2458, 2460, 2462, 2464, 2479, 2485, 2487, 2488, 2489, 2490, 2491, 2492, 2493, 2495, 2497, 2499, 2501, 2503, 2505, 2507, 2511, 2517, 2525, 2535, 2546, 2547, 2548, 2549, 2550, 2551, 2552, 2562, 2570, 2576, 2580, 2582, 2584, 2586, 2588, 2590, 2592, 2607, 2613, 2615, 2616, 2617, 2618, 2619, 2620, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2637, 2643, 2651, 2661, 2673, 2686, 2687, 2688, 2689, 2690, 2691, 2692, 2704, 2714, 2722, 2728, 2732, 2734, 2736, 2738, 2740, 2742, 2757, 2763, 2765, 2766, 2767, 2768, 2769, 2770, 2771, 2773, 2775, 2777, 2779, 2781, 2785, 2791, 2799, 2809, 2821, 2835, 2850, 2851, 2852, 2853, 2854, 2855, 2856, 2870, 2882, 2892, 2900, 2906, 2910, 2912, 2914, 2916, 2918, 2933, 2939, 2941, 2942, 2943, 2944, 2945, 2946, 2947, 2949, 2951, 2953, 2955, 2959, 2965, 2973, 2983, 2995, 3009, 3025, 3042, 3043, 3044, 3045, 3046, 3047, 3048, 3064, 3078, 3090, 3100, 3108, 3114, 3118, 3120, 3122, 3124, 3139, 3145, 3147, 3148, 3149, 3150, 3151, 3152, 3153, 3155, 3157, 3159, 3163, 3169, 3177, 3187, 3199, 3213, 3229, 3247, 3266, 3267, 3268, 3269, 3270, 3271, 3272, 3290, 3306, 3320, 3332, 3342, 3350, 3356, 3360, 3362, 3364, 3379, 3385, 3387, 3388, 3389, 3390, 3391, 3392, 3393, 3395, 3397, 3401, 3407, 3415, 3425, 3437, 3451, 3467, 3485, 3505, 3526, 3527, 3528, 3529, 3530, 3531, 3532, 3552, 3570, 3586, 3600, 3612, 3622, 3630, 3636, 3640, 3642, 3657, 3659, 3662, 3664, 3665, 3666, 3667, 3668, 3669, 3670, 3672, 3676, 3682, 3690, 3700, 3712, 3726, 3742, 3760, 3780, 3802, 3825, 3826, 3827, 3828, 3829, 3830, 3831, 3853, 3873, 3891, 3907, 3921, 3933, 3943, 3951, 3957, 3961, 3976]
[2024-05-24 23:53:35] [INFO ] Actually due to overlaps returned [321, 599, 839, 1045, 1221, 1371, 1499, 1609, 1705, 1791, 1871, 1950, 2028, 2107, 2187, 2273, 2369, 2479, 2607, 2757, 2933, 3139, 3379, 3657, 3976, 4, 9, 10, 11, 12, 13, 14, 190, 191, 192, 193, 194, 195, 329, 330, 331, 332, 333, 334, 486, 487, 488, 489, 490, 491, 607, 608, 609, 610, 611, 612, 742, 743, 744, 745, 746, 747, 847, 848, 849, 850, 851, 852, 962, 963, 964, 965, 966, 967, 1053, 1054, 1055, 1056, 1057, 1058, 1150, 1151, 1152, 1153, 1154, 1155, 1229, 1230, 1231, 1232, 1233, 1234, 1310, 1311, 1312, 1313, 1314, 1315, 1379, 1380, 1381, 1382, 1383, 1384, 1446, 1447, 1448, 1449, 1450, 1451, 1507, 1508, 1509, 1510, 1511, 1512, 1562, 1563, 1564, 1565, 1566, 1567, 1617, 1618, 1619, 1620, 1621, 1622, 1662, 1663, 1664, 1665, 1666, 1667, 1713, 1714, 1715, 1716, 1717, 1718, 1750, 1751, 1752, 1753, 1754, 1755, 1799, 1800, 1801, 1802, 1803, 1804, 1830, 1831, 1832, 1833, 1834, 1835, 1879, 1880, 1881, 1882, 1883, 1884, 1909, 1910, 1911, 1912, 1913, 1914, 1952, 1957, 1958, 1959, 1960, 1961, 1962, 1987, 1988, 1989, 1990, 1991, 1992, 2036, 2037, 2038, 2039, 2040, 2041, 2066, 2067, 2068, 2069, 2070, 2071, 2115, 2116, 2117, 2118, 2119, 2120, 2146, 2147, 2148, 2149, 2150, 2151, 2195, 2196, 2197, 2198, 2199, 2200, 2230, 2231, 2232, 2233, 2234, 2235, 2281, 2282, 2283, 2284, 2285, 2286, 2322, 2323, 2324, 2325, 2326, 2327, 2377, 2378, 2379, 2380, 2381, 2382, 2426, 2427, 2428, 2429, 2430, 2431, 2487, 2488, 2489, 2490, 2491, 2492, 2546, 2547, 2548, 2549, 2550, 2551, 2615, 2616, 2617, 2618, 2619, 2620, 2686, 2687, 2688, 2689, 2690, 2691, 2765, 2766, 2767, 2768, 2769, 2770, 2850, 2851, 2852, 2853, 2854, 2855, 2941, 2942, 2943, 2944, 2945, 2946, 3042, 3043, 3044, 3045, 3046, 3047, 3147, 3148, 3149, 3150, 3151, 3152, 3266, 3267, 3268, 3269, 3270, 3271, 3387, 3388, 3389, 3390, 3391, 3392, 3526, 3527, 3528, 3529, 3530, 3531, 3659, 3664, 3665, 3666, 3667, 3668, 3669, 3825, 3826, 3827, 3828, 3829, 3830]
Discarding 328 places :
Implicit Place search using SMT only with invariants took 13849 ms to find 328 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3973/4301 places, 10340/10340 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 3685 transition count 10052
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 3685 transition count 10052
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 864 place count 3397 transition count 9764
Iterating global reduction 0 with 288 rules applied. Total rules applied 1152 place count 3397 transition count 9764
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1155 place count 3397 transition count 9761
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1158 place count 3394 transition count 9761
Applied a total of 1158 rules in 1382 ms. Remains 3394 /3973 variables (removed 579) and now considering 9761/10340 (removed 579) transitions.
[2024-05-24 23:53:36] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 3394 cols
[2024-05-24 23:53:36] [INFO ] Computed 661 invariants in 150 ms
[2024-05-24 23:53:46] [INFO ] Implicit Places using invariants in 9534 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 281, 287, 291, 293, 312, 314, 316, 320, 326, 334, 344, 356, 370, 386, 404, 424, 445, 465, 483, 499, 513, 525, 535, 543, 549, 553, 555, 557, 565, 567, 569, 571, 575, 581, 589, 599, 611, 625, 641, 659, 678, 696, 712, 726, 738, 748, 756, 762, 766, 768, 770, 772, 780, 782, 784, 786, 788, 792, 798, 806, 816, 828, 842, 858, 875, 891, 905, 917, 927, 935, 941, 945, 947, 949, 951, 953, 961, 963, 965, 967, 969, 971, 975, 981, 989, 999, 1011, 1025, 1040, 1054, 1066, 1076, 1084, 1090, 1094, 1096, 1098, 1100, 1102, 1104, 1112, 1114, 1116, 1118, 1120, 1122, 1124, 1128, 1134, 1142, 1152, 1164, 1177, 1189, 1199, 1207, 1213, 1217, 1219, 1221, 1223, 1225, 1227, 1229, 1237, 1239, 1241, 1243, 1245, 1247, 1249, 1251, 1255, 1261, 1269, 1279, 1290, 1300, 1308, 1314, 1318, 1320, 1322, 1324, 1326, 1328, 1330, 1332, 1340, 1342, 1344, 1346, 1348, 1350, 1352, 1354, 1356, 1360, 1366, 1374, 1383, 1391, 1397, 1401, 1403, 1405, 1407, 1409, 1411, 1413, 1415, 1417, 1425, 1427, 1429, 1431, 1433, 1435, 1437, 1439, 1441, 1443, 1447, 1453, 1460, 1466, 1470, 1472, 1474, 1476, 1478, 1480, 1482, 1484, 1486, 1488, 1496, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1520, 1525, 1529, 1531, 1533, 1535, 1537, 1539, 1541, 1543, 1545, 1547, 1549, 1557, 1559, 1561, 1563, 1565, 1567, 1569, 1571, 1573, 1575, 1577, 1579, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1598, 1600, 1602, 1604, 1612, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1628, 1630, 1632, 1634, 1636, 1638, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1658, 1664, 1666, 1668, 1670, 1672, 1674, 1676, 1678, 1680, 1682, 1684, 1686, 1688, 1690, 1692, 1694, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1710, 1717, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1852, 1857, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1911, 1917, 1924, 1930, 1934, 1936, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1958, 1960, 1962, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 1980, 1986, 1994, 2003, 2011, 2017, 2021, 2023, 2025, 2027, 2029, 2031, 2033, 2035, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2059, 2063, 2069, 2077, 2087, 2098, 2108, 2116, 2122, 2126, 2128, 2130, 2132, 2134, 2136, 2138, 2146, 2148, 2150, 2152, 2154, 2156, 2158, 2160, 2164, 2170, 2178, 2188, 2200, 2213, 2225, 2235, 2243, 2249, 2253, 2255, 2257, 2259, 2261, 2263, 2271, 2273, 2275, 2277, 2279, 2281, 2283, 2287, 2293, 2301, 2311, 2323, 2337, 2352, 2366, 2378, 2388, 2396, 2402, 2406, 2408, 2410, 2412, 2414, 2422, 2424, 2426, 2428, 2430, 2432, 2436, 2442, 2450, 2460, 2472, 2486, 2502, 2519, 2535, 2549, 2561, 2571, 2579, 2585, 2589, 2591, 2593, 2595, 2603, 2605, 2607, 2609, 2611, 2615, 2621, 2629, 2639, 2651, 2665, 2681, 2699, 2718, 2736, 2752, 2766, 2778, 2788, 2796, 2802, 2806, 2808, 2810, 2818, 2820, 2822, 2824, 2828, 2834, 2842, 2852, 2864, 2878, 2894, 2912, 2932, 2953, 2973, 2991, 3007, 3021, 3033, 3043, 3051, 3057, 3061, 3063, 3069, 3071, 3073, 3077, 3083, 3091, 3101, 3113, 3127, 3143, 3161, 3181, 3203, 3226, 3248, 3268, 3286, 3302, 3316, 3328, 3338, 3346, 3352, 3356]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 9572 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2794/4301 places, 9761/10340 transitions.
Applied a total of 0 rules in 493 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 25818 ms. Remains : 2794/4301 places, 9761/10340 transitions.
[2024-05-24 23:53:46] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-24 23:53:47] [INFO ] Computed 61 invariants in 146 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 985447 steps (27947 resets) in 30001 ms. (32 steps per ms)
BEST_FIRST walk for 2000002 steps (4756 resets) in 6975 ms. (286 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 23:54:24] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:54:24] [INFO ] Invariant cache hit.
[2024-05-24 23:54:24] [INFO ] [Real]Absence check using 47 positive place invariants in 53 ms returned sat
[2024-05-24 23:54:24] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-24 23:54:27] [INFO ] [Real]Absence check using state equation in 2929 ms returned sat
[2024-05-24 23:54:27] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:54:28] [INFO ] [Real]Added 5602 Read/Feed constraints in 1077 ms returned sat
[2024-05-24 23:54:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:54:29] [INFO ] [Nat]Absence check using 47 positive place invariants in 56 ms returned sat
[2024-05-24 23:54:29] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-24 23:54:32] [INFO ] [Nat]Absence check using state equation in 2969 ms returned sat
[2024-05-24 23:54:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:54:41] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9326 ms returned unknown
[2024-05-24 23:54:41] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2024-05-24 23:54:41] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-24 23:54:44] [INFO ] [Real]Absence check using state equation in 2304 ms returned sat
[2024-05-24 23:54:46] [INFO ] [Real]Added 5602 Read/Feed constraints in 2659 ms returned sat
[2024-05-24 23:54:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:54:47] [INFO ] [Nat]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-05-24 23:54:47] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 4 ms returned sat
[2024-05-24 23:54:49] [INFO ] [Nat]Absence check using state equation in 2465 ms returned sat
[2024-05-24 23:54:54] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 23:54:59] [INFO ] [Nat]Added 5602 Read/Feed constraints in 9298 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 473 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 468 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2024-05-24 23:55:00] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:55:00] [INFO ] Invariant cache hit.
[2024-05-24 23:55:05] [INFO ] Implicit Places using invariants in 5371 ms returned []
[2024-05-24 23:55:05] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:55:05] [INFO ] Invariant cache hit.
[2024-05-24 23:55:08] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:55:39] [INFO ] Performed 286/2794 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:56:10] [INFO ] Performed 650/2794 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:56:41] [INFO ] Performed 861/2794 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-05-24 23:57:11] [INFO ] Performed 1155/2794 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2024-05-24 23:57:11] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2024-05-24 23:57:11] [INFO ] Implicit Places using invariants and state equation in 126300 ms returned []
Implicit Place search using SMT with State Equation took 131674 ms to find 0 implicit places.
[2024-05-24 23:57:13] [INFO ] Redundant transitions in 1325 ms returned []
Running 9667 sub problems to find dead transitions.
[2024-05-24 23:57:13] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:57:13] [INFO ] Invariant cache hit.
[2024-05-24 23:57:13] [INFO ] State equation strengthened by 5602 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2792 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9667 unsolved
SMT process timed out in 88184ms, After SMT, problems are : Problem set: 0 solved, 9667 unsolved
Search for dead transitions found 0 dead transitions in 88300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221835 ms. Remains : 2794/2794 places, 9761/9761 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1634 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (95 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (93 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (89 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 25044 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 4
Probabilistic random walk after 25044 steps, saw 10669 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 23:58:45] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:58:45] [INFO ] Invariant cache hit.
[2024-05-24 23:58:45] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2672/2674 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2674 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/2700 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 23:58:48] [INFO ] Deduced a trap composed of 273 places in 2116 ms of which 30 ms to minimize.
[2024-05-24 23:58:50] [INFO ] Deduced a trap composed of 167 places in 2171 ms of which 18 ms to minimize.
SMT process timed out in 5204ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 534 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 2794/2794 places, 9761/9761 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1393 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (94 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (93 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 24882 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 4
Probabilistic random walk after 24882 steps, saw 10597 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 23:58:54] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:58:54] [INFO ] Invariant cache hit.
[2024-05-24 23:58:54] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2672/2674 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2674 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/2700 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 23:58:57] [INFO ] Deduced a trap composed of 273 places in 2319 ms of which 17 ms to minimize.
[2024-05-24 23:59:00] [INFO ] Deduced a trap composed of 167 places in 2083 ms of which 18 ms to minimize.
[2024-05-24 23:59:02] [INFO ] Deduced a trap composed of 386 places in 2115 ms of which 18 ms to minimize.
[2024-05-24 23:59:04] [INFO ] Deduced a trap composed of 127 places in 2165 ms of which 18 ms to minimize.
[2024-05-24 23:59:06] [INFO ] Deduced a trap composed of 318 places in 2088 ms of which 17 ms to minimize.
[2024-05-24 23:59:08] [INFO ] Deduced a trap composed of 97 places in 2116 ms of which 18 ms to minimize.
[2024-05-24 23:59:10] [INFO ] Deduced a trap composed of 409 places in 2069 ms of which 18 ms to minimize.
[2024-05-24 23:59:12] [INFO ] Deduced a trap composed of 422 places in 2052 ms of which 17 ms to minimize.
[2024-05-24 23:59:14] [INFO ] Deduced a trap composed of 97 places in 2043 ms of which 17 ms to minimize.
[2024-05-24 23:59:17] [INFO ] Deduced a trap composed of 361 places in 2054 ms of which 18 ms to minimize.
[2024-05-24 23:59:19] [INFO ] Deduced a trap composed of 511 places in 2196 ms of which 18 ms to minimize.
[2024-05-24 23:59:21] [INFO ] Deduced a trap composed of 103 places in 2198 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2700 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2700 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 38/2738 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2738 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 44/2782 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2782 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/2794 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2794 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8875/11669 variables, 2794/2867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11669 variables, 5602/8469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11669 variables, 0/8469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/11669 variables, 0/8469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11669/11669 variables, and 8469 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37387 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2794/2794 constraints, ReadFeed: 5602/5602 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2672/2674 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2674 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/2700 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2700 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 23:59:34] [INFO ] Deduced a trap composed of 223 places in 2106 ms of which 16 ms to minimize.
[2024-05-24 23:59:36] [INFO ] Deduced a trap composed of 274 places in 2161 ms of which 17 ms to minimize.
[2024-05-24 23:59:39] [INFO ] Deduced a trap composed of 138 places in 2194 ms of which 18 ms to minimize.
[2024-05-24 23:59:41] [INFO ] Deduced a trap composed of 96 places in 2139 ms of which 18 ms to minimize.
[2024-05-24 23:59:43] [INFO ] Deduced a trap composed of 267 places in 2147 ms of which 17 ms to minimize.
[2024-05-24 23:59:45] [INFO ] Deduced a trap composed of 309 places in 2131 ms of which 18 ms to minimize.
[2024-05-24 23:59:47] [INFO ] Deduced a trap composed of 535 places in 2041 ms of which 18 ms to minimize.
[2024-05-24 23:59:50] [INFO ] Deduced a trap composed of 257 places in 2081 ms of which 18 ms to minimize.
[2024-05-24 23:59:52] [INFO ] Deduced a trap composed of 145 places in 2117 ms of which 17 ms to minimize.
[2024-05-24 23:59:54] [INFO ] Deduced a trap composed of 103 places in 2179 ms of which 17 ms to minimize.
[2024-05-24 23:59:56] [INFO ] Deduced a trap composed of 113 places in 2125 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2700 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2700 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 38/2738 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 23:59:59] [INFO ] Deduced a trap composed of 5 places in 2314 ms of which 18 ms to minimize.
[2024-05-25 00:00:01] [INFO ] Deduced a trap composed of 39 places in 2370 ms of which 20 ms to minimize.
[2024-05-25 00:00:04] [INFO ] Deduced a trap composed of 111 places in 2354 ms of which 19 ms to minimize.
[2024-05-25 00:00:06] [INFO ] Deduced a trap composed of 102 places in 2434 ms of which 20 ms to minimize.
[2024-05-25 00:00:09] [INFO ] Deduced a trap composed of 100 places in 2387 ms of which 20 ms to minimize.
[2024-05-25 00:00:11] [INFO ] Deduced a trap composed of 95 places in 2418 ms of which 19 ms to minimize.
[2024-05-25 00:00:13] [INFO ] Deduced a trap composed of 101 places in 2376 ms of which 18 ms to minimize.
[2024-05-25 00:00:16] [INFO ] Deduced a trap composed of 70 places in 2303 ms of which 19 ms to minimize.
[2024-05-25 00:00:18] [INFO ] Deduced a trap composed of 103 places in 2305 ms of which 18 ms to minimize.
SMT process timed out in 83997ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 531 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 471 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
[2024-05-25 00:00:19] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 00:00:19] [INFO ] Invariant cache hit.
[2024-05-25 00:00:24] [INFO ] Implicit Places using invariants in 5312 ms returned []
[2024-05-25 00:00:24] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 00:00:24] [INFO ] Invariant cache hit.
[2024-05-25 00:00:28] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 00:00:58] [INFO ] Performed 289/2794 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:01:28] [INFO ] Performed 663/2794 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:02:00] [INFO ] Performed 861/2794 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-25 00:02:30] [INFO ] Performed 1134/2794 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2024-05-25 00:02:30] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2024-05-25 00:02:30] [INFO ] Implicit Places using invariants and state equation in 125453 ms returned []
Implicit Place search using SMT with State Equation took 130768 ms to find 0 implicit places.
[2024-05-25 00:02:31] [INFO ] Redundant transitions in 1304 ms returned []
Running 9667 sub problems to find dead transitions.
[2024-05-25 00:02:31] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 00:02:31] [INFO ] Invariant cache hit.
[2024-05-25 00:02:31] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2792 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9667 unsolved
SMT process timed out in 91935ms, After SMT, problems are : Problem set: 0 solved, 9667 unsolved
Search for dead transitions found 0 dead transitions in 92028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224638 ms. Remains : 2794/2794 places, 9761/9761 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-25 00:04:03] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 00:04:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (283 resets) in 320 ms. (31 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-25 00:04:04] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 00:04:04] [INFO ] Invariant cache hit.
[2024-05-25 00:04:04] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-05-25 00:04:04] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 6 ms returned sat
[2024-05-25 00:04:07] [INFO ] [Real]Absence check using state equation in 3178 ms returned sat
[2024-05-25 00:04:07] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 00:04:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:09] [INFO ] [Real]Added 5602 Read/Feed constraints in 1173 ms returned sat
[2024-05-25 00:04:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 00:04:09] [INFO ] [Nat]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 00:04:09] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 17 ms returned sat
[2024-05-25 00:04:12] [INFO ] [Nat]Absence check using state equation in 3209 ms returned sat
[2024-05-25 00:04:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:04:14] [INFO ] [Nat]Added 5602 Read/Feed constraints in 1447 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2794 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node1ThinksNode18ShouldBeNodeMasterToReplaceNode17) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9759/9759 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2793 transition count 9757
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2792 transition count 9755
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 2791 transition count 9753
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 2790 transition count 9751
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 2789 transition count 9749
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 2788 transition count 9747
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 2787 transition count 9745
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 2786 transition count 9743
Applied a total of 8 rules in 695 ms. Remains 2786 /2794 variables (removed 8) and now considering 9743/9759 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 2786/2794 places, 9743/9759 transitions.
[2024-05-25 00:04:14] [INFO ] Flow matrix only has 8857 transitions (discarded 886 similar events)
// Phase 1: matrix 8857 rows 2786 cols
[2024-05-25 00:04:15] [INFO ] Computed 61 invariants in 235 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 960781 steps (27250 resets) in 30001 ms. (32 steps per ms)
BEST_FIRST walk for 1000001 steps (2379 resets) in 3565 ms. (280 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-25 00:04:48] [INFO ] Flow matrix only has 8857 transitions (discarded 886 similar events)
[2024-05-25 00:04:48] [INFO ] Invariant cache hit.
[2024-05-25 00:04:49] [INFO ] [Real]Absence check using 47 positive place invariants in 52 ms returned sat
[2024-05-25 00:04:49] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-25 00:04:52] [INFO ] [Real]Absence check using state equation in 3873 ms returned sat
[2024-05-25 00:04:53] [INFO ] State equation strengthened by 5593 read => feed constraints.
[2024-05-25 00:04:54] [INFO ] [Real]Added 5593 Read/Feed constraints in 1610 ms returned sat
[2024-05-25 00:04:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 00:04:55] [INFO ] [Nat]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 00:04:55] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 3 ms returned sat
[2024-05-25 00:04:59] [INFO ] [Nat]Absence check using state equation in 3991 ms returned sat
[2024-05-25 00:05:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:05:07] [INFO ] [Nat]Added 5593 Read/Feed constraints in 8495 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[0]
FORMULA MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-04 in 64043 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-25 00:05:07] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-25 00:05:07] [INFO ] Computed 61 invariants in 129 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (283 resets) in 324 ms. (30 steps per ms)
BEST_FIRST walk for 10001 steps (24 resets) in 37 ms. (263 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-25 00:05:08] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-25 00:05:08] [INFO ] Invariant cache hit.
[2024-05-25 00:05:08] [INFO ] [Real]Absence check using 47 positive place invariants in 50 ms returned sat
[2024-05-25 00:05:08] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-25 00:05:11] [INFO ] [Real]Absence check using state equation in 2415 ms returned sat
[2024-05-25 00:05:11] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-25 00:05:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:05:13] [INFO ] [Real]Added 5602 Read/Feed constraints in 2035 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2794 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node24ThinksNode7ShouldBeNodeMasterToReplaceNode8) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9759/9759 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2793 transition count 9757
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2792 transition count 9755
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 2791 transition count 9753
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 2790 transition count 9751
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 2789 transition count 9749
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 2788 transition count 9747
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 2787 transition count 9745
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 2786 transition count 9743
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 2785 transition count 9741
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 2784 transition count 9739
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 2783 transition count 9737
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 2782 transition count 9735
Applied a total of 12 rules in 616 ms. Remains 2782 /2794 variables (removed 12) and now considering 9735/9759 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 2782/2794 places, 9735/9759 transitions.
[2024-05-25 00:05:14] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
// Phase 1: matrix 8849 rows 2782 cols
[2024-05-25 00:05:14] [INFO ] Computed 61 invariants in 247 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 946430 steps (26841 resets) in 30001 ms. (31 steps per ms)
BEST_FIRST walk for 1000001 steps (2379 resets) in 3775 ms. (264 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-25 00:05:48] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:05:48] [INFO ] Invariant cache hit.
[2024-05-25 00:05:48] [INFO ] [Real]Absence check using 47 positive place invariants in 55 ms returned sat
[2024-05-25 00:05:48] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-25 00:05:51] [INFO ] [Real]Absence check using state equation in 3226 ms returned sat
[2024-05-25 00:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 00:05:52] [INFO ] [Nat]Absence check using 47 positive place invariants in 54 ms returned sat
[2024-05-25 00:05:52] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 5 ms returned sat
[2024-05-25 00:05:55] [INFO ] [Nat]Absence check using state equation in 3247 ms returned sat
[2024-05-25 00:05:55] [INFO ] State equation strengthened by 5589 read => feed constraints.
[2024-05-25 00:06:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 00:06:04] [INFO ] [Nat]Added 5589 Read/Feed constraints in 9222 ms returned sat
[2024-05-25 00:06:07] [INFO ] Deduced a trap composed of 372 places in 2352 ms of which 19 ms to minimize.
[2024-05-25 00:06:10] [INFO ] Deduced a trap composed of 358 places in 2298 ms of which 19 ms to minimize.
[2024-05-25 00:06:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5342 ms
[2024-05-25 00:06:11] [INFO ] Computed and/alt/rep : 4524/6553/4524 causal constraints (skipped 4231 transitions) in 913 ms.
[2024-05-25 00:06:14] [INFO ] Added : 20 causal constraints over 5 iterations in 3908 ms. Result :sat
Minimization took 11970 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 2782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 9735/9735 transitions.
Applied a total of 0 rules in 520 ms. Remains 2782 /2782 variables (removed 0) and now considering 9735/9735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 2782/2782 places, 9735/9735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 9735/9735 transitions.
Applied a total of 0 rules in 486 ms. Remains 2782 /2782 variables (removed 0) and now considering 9735/9735 (removed 0) transitions.
[2024-05-25 00:06:27] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:06:27] [INFO ] Invariant cache hit.
[2024-05-25 00:06:32] [INFO ] Implicit Places using invariants in 5399 ms returned []
[2024-05-25 00:06:32] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:06:32] [INFO ] Invariant cache hit.
[2024-05-25 00:06:36] [INFO ] State equation strengthened by 5589 read => feed constraints.
[2024-05-25 00:07:07] [INFO ] Performed 287/2782 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:07:40] [INFO ] Performed 704/2782 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2024-05-25 00:08:10] [INFO ] Performed 977/2782 implicitness test of which 0 returned IMPLICIT in 93 seconds.
[2024-05-25 00:08:40] [INFO ] Performed 1090/2782 implicitness test of which 0 returned IMPLICIT in 123 seconds.
[2024-05-25 00:08:40] [INFO ] Timeout of Implicit test with SMT after 123 seconds.
[2024-05-25 00:08:40] [INFO ] Implicit Places using invariants and state equation in 128037 ms returned []
Implicit Place search using SMT with State Equation took 133441 ms to find 0 implicit places.
[2024-05-25 00:08:41] [INFO ] Redundant transitions in 1172 ms returned []
Running 9641 sub problems to find dead transitions.
[2024-05-25 00:08:41] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:08:41] [INFO ] Invariant cache hit.
[2024-05-25 00:08:42] [INFO ] State equation strengthened by 5589 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2779 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 9641 unsolved
SMT process timed out in 87660ms, After SMT, problems are : Problem set: 0 solved, 9641 unsolved
Search for dead transitions found 0 dead transitions in 87737ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222882 ms. Remains : 2782/2782 places, 9735/9735 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1381 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 24721 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 24721 steps, saw 10541 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:10:13] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:10:13] [INFO ] Invariant cache hit.
[2024-05-25 00:10:13] [INFO ] State equation strengthened by 5589 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2661/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/2726 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2726 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2770 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2770 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/2782 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2782 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8849/11631 variables, 2782/2843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11631 variables, 5589/8432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11631 variables, 0/8432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11631/11631 variables, and 8432 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2782/2782 constraints, ReadFeed: 5589/5589 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2661/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:10:20] [INFO ] Deduced a trap composed of 119 places in 2144 ms of which 18 ms to minimize.
[2024-05-25 00:10:22] [INFO ] Deduced a trap composed of 525 places in 2084 ms of which 16 ms to minimize.
[2024-05-25 00:10:25] [INFO ] Deduced a trap composed of 113 places in 2031 ms of which 17 ms to minimize.
SMT process timed out in 11898ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 9735/9735 transitions.
Applied a total of 0 rules in 465 ms. Remains 2782 /2782 variables (removed 0) and now considering 9735/9735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 2782/2782 places, 9735/9735 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1396 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 25807 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25807 steps, saw 10980 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:10:29] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:10:29] [INFO ] Invariant cache hit.
[2024-05-25 00:10:29] [INFO ] State equation strengthened by 5589 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2661/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/2726 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2726 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/2770 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2770 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/2782 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2782 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8849/11631 variables, 2782/2843 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11631 variables, 5589/8432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11631 variables, 0/8432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/11631 variables, 0/8432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11631/11631 variables, and 8432 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6010 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2782/2782 constraints, ReadFeed: 5589/5589 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2661/2662 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2662 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/2688 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:10:37] [INFO ] Deduced a trap composed of 119 places in 2184 ms of which 18 ms to minimize.
[2024-05-25 00:10:39] [INFO ] Deduced a trap composed of 525 places in 2177 ms of which 18 ms to minimize.
[2024-05-25 00:10:42] [INFO ] Deduced a trap composed of 113 places in 2188 ms of which 19 ms to minimize.
[2024-05-25 00:10:44] [INFO ] Deduced a trap composed of 279 places in 2202 ms of which 17 ms to minimize.
[2024-05-25 00:10:46] [INFO ] Deduced a trap composed of 145 places in 2284 ms of which 17 ms to minimize.
[2024-05-25 00:10:48] [INFO ] Deduced a trap composed of 117 places in 2229 ms of which 18 ms to minimize.
[2024-05-25 00:10:51] [INFO ] Deduced a trap composed of 113 places in 2197 ms of which 19 ms to minimize.
[2024-05-25 00:10:53] [INFO ] Deduced a trap composed of 535 places in 2060 ms of which 16 ms to minimize.
[2024-05-25 00:10:55] [INFO ] Deduced a trap composed of 167 places in 2089 ms of which 16 ms to minimize.
[2024-05-25 00:10:57] [INFO ] Deduced a trap composed of 223 places in 2071 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2688 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2688 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/2726 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:11:00] [INFO ] Deduced a trap composed of 5 places in 2171 ms of which 18 ms to minimize.
[2024-05-25 00:11:02] [INFO ] Deduced a trap composed of 39 places in 2113 ms of which 17 ms to minimize.
[2024-05-25 00:11:04] [INFO ] Deduced a trap composed of 39 places in 2112 ms of which 18 ms to minimize.
[2024-05-25 00:11:06] [INFO ] Deduced a trap composed of 89 places in 2216 ms of which 19 ms to minimize.
[2024-05-25 00:11:08] [INFO ] Deduced a trap composed of 98 places in 2068 ms of which 17 ms to minimize.
[2024-05-25 00:11:10] [INFO ] Deduced a trap composed of 213 places in 2108 ms of which 23 ms to minimize.
[2024-05-25 00:11:12] [INFO ] Deduced a trap composed of 185 places in 2078 ms of which 19 ms to minimize.
[2024-05-25 00:11:15] [INFO ] Deduced a trap composed of 70 places in 2057 ms of which 17 ms to minimize.
[2024-05-25 00:11:17] [INFO ] Deduced a trap composed of 98 places in 1982 ms of which 18 ms to minimize.
[2024-05-25 00:11:19] [INFO ] Deduced a trap composed of 123 places in 1876 ms of which 18 ms to minimize.
[2024-05-25 00:11:21] [INFO ] Deduced a trap composed of 123 places in 2239 ms of which 18 ms to minimize.
SMT process timed out in 52323ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 9735/9735 transitions.
Applied a total of 0 rules in 526 ms. Remains 2782 /2782 variables (removed 0) and now considering 9735/9735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 2782/2782 places, 9735/9735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 9735/9735 transitions.
Applied a total of 0 rules in 521 ms. Remains 2782 /2782 variables (removed 0) and now considering 9735/9735 (removed 0) transitions.
[2024-05-25 00:11:22] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:11:22] [INFO ] Invariant cache hit.
[2024-05-25 00:11:27] [INFO ] Implicit Places using invariants in 5237 ms returned []
[2024-05-25 00:11:27] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:11:27] [INFO ] Invariant cache hit.
[2024-05-25 00:11:31] [INFO ] State equation strengthened by 5589 read => feed constraints.
[2024-05-25 00:12:02] [INFO ] Performed 287/2782 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:12:35] [INFO ] Performed 704/2782 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2024-05-25 00:13:05] [INFO ] Performed 983/2782 implicitness test of which 0 returned IMPLICIT in 93 seconds.
[2024-05-25 00:13:35] [INFO ] Performed 1091/2782 implicitness test of which 0 returned IMPLICIT in 123 seconds.
[2024-05-25 00:13:35] [INFO ] Timeout of Implicit test with SMT after 123 seconds.
[2024-05-25 00:13:35] [INFO ] Implicit Places using invariants and state equation in 127819 ms returned []
Implicit Place search using SMT with State Equation took 133057 ms to find 0 implicit places.
[2024-05-25 00:13:36] [INFO ] Redundant transitions in 1208 ms returned []
Running 9641 sub problems to find dead transitions.
[2024-05-25 00:13:36] [INFO ] Flow matrix only has 8849 transitions (discarded 886 similar events)
[2024-05-25 00:13:36] [INFO ] Invariant cache hit.
[2024-05-25 00:13:36] [INFO ] State equation strengthened by 5589 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2779 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 9641 unsolved
SMT process timed out in 85587ms, After SMT, problems are : Problem set: 0 solved, 9641 unsolved
Search for dead transitions found 0 dead transitions in 85664ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220482 ms. Remains : 2782/2782 places, 9735/9735 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C06-UpperBounds-08 in 594507 ms.
[2024-05-25 00:15:03] [INFO ] Flatten gal took : 600 ms
[2024-05-25 00:15:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-25 00:15:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2794 places, 9761 transitions and 47838 arcs took 46 ms.
Total runtime 1993890 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S24C06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2794
TRANSITIONS: 9761
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.233s, Sys 0.028s]
SAVING FILE /home/mcc/execution/402/model (.net / .def) ...
EXPORT TIME: [User 0.036s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1154
MODEL NAME: /home/mcc/execution/402/model
2794 places, 9761 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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-S24C06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C06, 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 r245-tall-171654349200093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C06.tgz
mv MultiCrashLeafsetExtension-PT-S24C06 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 ;