Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079800102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079800102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748735143114

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:45:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 23:45:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:45:44] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2025-05-31 23:45:44] [INFO ] Transformed 1090 places.
[2025-05-31 23:45:44] [INFO ] Transformed 5200 transitions.
[2025-05-31 23:45:44] [INFO ] Found NUPN structural information;
[2025-05-31 23:45:44] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:45:44] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2025-05-31 23:45:44] [INFO ] Computed 31 invariants in 23 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 74 ms. (133 steps per ms)
FORMULA EisenbergMcGuire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 83 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:45:45] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
[2025-05-31 23:45:45] [INFO ] Invariant cache hit.
[2025-05-31 23:45:45] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned sat
[2025-05-31 23:45:45] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:45:46] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2025-05-31 23:45:46] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2025-05-31 23:45:46] [INFO ] [Real]Added 1246 Read/Feed constraints in 155 ms returned sat
[2025-05-31 23:45:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:45:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 26 ms returned sat
[2025-05-31 23:45:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2025-05-31 23:45:47] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-05-31 23:45:47] [INFO ] [Nat]Added 1246 Read/Feed constraints in 194 ms returned sat
[2025-05-31 23:45:48] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 52 ms to minimize.
[2025-05-31 23:45:48] [INFO ] Deduced a trap composed of 62 places in 538 ms of which 7 ms to minimize.
[2025-05-31 23:45:49] [INFO ] Deduced a trap composed of 3 places in 508 ms of which 8 ms to minimize.
[2025-05-31 23:45:49] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 6 ms to minimize.
[2025-05-31 23:45:50] [INFO ] Deduced a trap composed of 3 places in 498 ms of which 6 ms to minimize.
[2025-05-31 23:45:51] [INFO ] Deduced a trap composed of 3 places in 437 ms of which 5 ms to minimize.
[2025-05-31 23:45:51] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 6 ms to minimize.
[2025-05-31 23:45:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2025-05-31 23:45:51] [INFO ] [Real]Absence check using 21 positive place invariants in 25 ms returned sat
[2025-05-31 23:45:51] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2025-05-31 23:45:52] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2025-05-31 23:45:52] [INFO ] [Real]Added 1246 Read/Feed constraints in 154 ms returned sat
[2025-05-31 23:45:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:45:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2025-05-31 23:45:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:45:53] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2025-05-31 23:45:53] [INFO ] [Nat]Added 1246 Read/Feed constraints in 171 ms returned sat
[2025-05-31 23:45:54] [INFO ] Deduced a trap composed of 3 places in 492 ms of which 6 ms to minimize.
[2025-05-31 23:45:54] [INFO ] Deduced a trap composed of 3 places in 502 ms of which 6 ms to minimize.
[2025-05-31 23:45:55] [INFO ] Deduced a trap composed of 47 places in 488 ms of which 6 ms to minimize.
[2025-05-31 23:45:55] [INFO ] Deduced a trap composed of 26 places in 493 ms of which 6 ms to minimize.
[2025-05-31 23:45:56] [INFO ] Deduced a trap composed of 3 places in 501 ms of which 6 ms to minimize.
[2025-05-31 23:45:56] [INFO ] Deduced a trap composed of 47 places in 426 ms of which 5 ms to minimize.
[2025-05-31 23:45:57] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 5 ms to minimize.
[2025-05-31 23:45:57] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 5 ms to minimize.
[2025-05-31 23:45:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2025-05-31 23:45:58] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2025-05-31 23:45:58] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:45:58] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2025-05-31 23:45:58] [INFO ] [Real]Added 1246 Read/Feed constraints in 139 ms returned sat
[2025-05-31 23:45:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:45:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-05-31 23:45:58] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2025-05-31 23:45:59] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2025-05-31 23:45:59] [INFO ] [Nat]Added 1246 Read/Feed constraints in 156 ms returned sat
[2025-05-31 23:46:00] [INFO ] Deduced a trap composed of 3 places in 469 ms of which 5 ms to minimize.
[2025-05-31 23:46:00] [INFO ] Deduced a trap composed of 3 places in 463 ms of which 6 ms to minimize.
[2025-05-31 23:46:01] [INFO ] Deduced a trap composed of 51 places in 473 ms of which 6 ms to minimize.
[2025-05-31 23:46:01] [INFO ] Deduced a trap composed of 56 places in 460 ms of which 5 ms to minimize.
[2025-05-31 23:46:02] [INFO ] Deduced a trap composed of 6 places in 460 ms of which 6 ms to minimize.
[2025-05-31 23:46:02] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 6 ms to minimize.
[2025-05-31 23:46:03] [INFO ] Deduced a trap composed of 3 places in 475 ms of which 6 ms to minimize.
[2025-05-31 23:46:03] [INFO ] Deduced a trap composed of 90 places in 419 ms of which 5 ms to minimize.
[2025-05-31 23:46:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2025-05-31 23:46:04] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2025-05-31 23:46:04] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:46:04] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2025-05-31 23:46:04] [INFO ] [Real]Added 1246 Read/Feed constraints in 183 ms returned sat
[2025-05-31 23:46:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2025-05-31 23:46:05] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:46:05] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2025-05-31 23:46:05] [INFO ] [Nat]Added 1246 Read/Feed constraints in 199 ms returned sat
[2025-05-31 23:46:06] [INFO ] Deduced a trap composed of 3 places in 516 ms of which 5 ms to minimize.
[2025-05-31 23:46:06] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 6 ms to minimize.
[2025-05-31 23:46:07] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 5 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 3 places in 495 ms of which 6 ms to minimize.
[2025-05-31 23:46:08] [INFO ] Deduced a trap composed of 69 places in 497 ms of which 6 ms to minimize.
[2025-05-31 23:46:09] [INFO ] Deduced a trap composed of 3 places in 500 ms of which 5 ms to minimize.
[2025-05-31 23:46:09] [INFO ] Deduced a trap composed of 35 places in 480 ms of which 5 ms to minimize.
[2025-05-31 23:46:10] [INFO ] Deduced a trap composed of 59 places in 492 ms of which 6 ms to minimize.
[2025-05-31 23:46:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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)
[2025-05-31 23:46:10] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-05-31 23:46:10] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2025-05-31 23:46:10] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2025-05-31 23:46:11] [INFO ] [Real]Added 1246 Read/Feed constraints in 186 ms returned sat
[2025-05-31 23:46:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2025-05-31 23:46:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2025-05-31 23:46:11] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2025-05-31 23:46:12] [INFO ] [Nat]Added 1246 Read/Feed constraints in 198 ms returned sat
[2025-05-31 23:46:12] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 5 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 3 places in 500 ms of which 5 ms to minimize.
[2025-05-31 23:46:13] [INFO ] Deduced a trap composed of 6 places in 509 ms of which 6 ms to minimize.
[2025-05-31 23:46:14] [INFO ] Deduced a trap composed of 56 places in 478 ms of which 9 ms to minimize.
[2025-05-31 23:46:14] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 6 ms to minimize.
[2025-05-31 23:46:15] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 5 ms to minimize.
[2025-05-31 23:46:16] [INFO ] Deduced a trap composed of 3 places in 476 ms of which 6 ms to minimize.
[2025-05-31 23:46:16] [INFO ] Deduced a trap composed of 117 places in 413 ms of which 5 ms to minimize.
[2025-05-31 23:46:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2025-05-31 23:46:16] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-05-31 23:46:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2025-05-31 23:46:17] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2025-05-31 23:46:17] [INFO ] [Real]Added 1246 Read/Feed constraints in 147 ms returned sat
[2025-05-31 23:46:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 24 ms returned sat
[2025-05-31 23:46:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:46:18] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-05-31 23:46:18] [INFO ] [Nat]Added 1246 Read/Feed constraints in 149 ms returned sat
[2025-05-31 23:46:18] [INFO ] Deduced a trap composed of 3 places in 499 ms of which 6 ms to minimize.
[2025-05-31 23:46:19] [INFO ] Deduced a trap composed of 44 places in 495 ms of which 5 ms to minimize.
[2025-05-31 23:46:20] [INFO ] Deduced a trap composed of 3 places in 499 ms of which 5 ms to minimize.
[2025-05-31 23:46:20] [INFO ] Deduced a trap composed of 4 places in 500 ms of which 6 ms to minimize.
[2025-05-31 23:46:21] [INFO ] Deduced a trap composed of 63 places in 492 ms of which 5 ms to minimize.
[2025-05-31 23:46:21] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 6 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 56 places in 461 ms of which 5 ms to minimize.
[2025-05-31 23:46:22] [INFO ] Deduced a trap composed of 49 places in 466 ms of which 6 ms to minimize.
[2025-05-31 23:46:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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)
[2025-05-31 23:46:23] [INFO ] [Real]Absence check using 21 positive place invariants in 26 ms returned sat
[2025-05-31 23:46:23] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:46:23] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2025-05-31 23:46:23] [INFO ] [Real]Added 1246 Read/Feed constraints in 167 ms returned sat
[2025-05-31 23:46:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 26 ms returned sat
[2025-05-31 23:46:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:46:24] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2025-05-31 23:46:24] [INFO ] [Nat]Added 1246 Read/Feed constraints in 164 ms returned sat
[2025-05-31 23:46:25] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 5 ms to minimize.
[2025-05-31 23:46:25] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 5 ms to minimize.
[2025-05-31 23:46:26] [INFO ] Deduced a trap composed of 3 places in 458 ms of which 5 ms to minimize.
[2025-05-31 23:46:26] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 6 ms to minimize.
[2025-05-31 23:46:27] [INFO ] Deduced a trap composed of 3 places in 470 ms of which 5 ms to minimize.
[2025-05-31 23:46:27] [INFO ] Deduced a trap composed of 3 places in 488 ms of which 6 ms to minimize.
[2025-05-31 23:46:28] [INFO ] Deduced a trap composed of 64 places in 487 ms of which 5 ms to minimize.
[2025-05-31 23:46:29] [INFO ] Deduced a trap composed of 79 places in 487 ms of which 5 ms to minimize.
[2025-05-31 23:46:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2025-05-31 23:46:29] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2025-05-31 23:46:29] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:46:29] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-05-31 23:46:29] [INFO ] [Real]Added 1246 Read/Feed constraints in 167 ms returned sat
[2025-05-31 23:46:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2025-05-31 23:46:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:46:30] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2025-05-31 23:46:30] [INFO ] [Nat]Added 1246 Read/Feed constraints in 206 ms returned sat
[2025-05-31 23:46:31] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 9 ms to minimize.
[2025-05-31 23:46:32] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 5 ms to minimize.
[2025-05-31 23:46:32] [INFO ] Deduced a trap composed of 57 places in 526 ms of which 6 ms to minimize.
[2025-05-31 23:46:33] [INFO ] Deduced a trap composed of 3 places in 505 ms of which 5 ms to minimize.
[2025-05-31 23:46:33] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 4 ms to minimize.
[2025-05-31 23:46:34] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 5 ms to minimize.
[2025-05-31 23:46:34] [INFO ] Deduced a trap composed of 32 places in 467 ms of which 5 ms to minimize.
[2025-05-31 23:46:35] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 4 ms to minimize.
[2025-05-31 23:46:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 304 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 304 Pre rules applied. Total rules applied 20 place count 1080 transition count 4886
Deduced a syphon composed of 304 places in 8 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 2 with 608 rules applied. Total rules applied 628 place count 776 transition count 4886
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 718 place count 686 transition count 3986
Iterating global reduction 2 with 90 rules applied. Total rules applied 808 place count 686 transition count 3986
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 9 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 986 place count 597 transition count 3897
Applied a total of 986 rules in 580 ms. Remains 597 /1090 variables (removed 493) and now considering 3897/5200 (removed 1303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 597/1090 places, 3897/5200 transitions.
[2025-05-31 23:46:35] [INFO ] Flow matrix only has 1027 transitions (discarded 2870 similar events)
// Phase 1: matrix 1027 rows 597 cols
[2025-05-31 23:46:35] [INFO ] Computed 31 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2533 ms. (394 steps per ms)
FORMULA EisenbergMcGuire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000007 steps (14 resets) in 3738 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:46:42] [INFO ] Flow matrix only has 1027 transitions (discarded 2870 similar events)
[2025-05-31 23:46:42] [INFO ] Invariant cache hit.
[2025-05-31 23:46:42] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:42] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:42] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-05-31 23:46:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-05-31 23:46:42] [INFO ] [Real]Added 436 Read/Feed constraints in 69 ms returned sat
[2025-05-31 23:46:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2025-05-31 23:46:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:42] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-05-31 23:46:42] [INFO ] [Nat]Added 436 Read/Feed constraints in 55 ms returned sat
[2025-05-31 23:46:43] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-05-31 23:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-05-31 23:46:43] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 141 ms.
[2025-05-31 23:46:43] [INFO ] Added : 28 causal constraints over 6 iterations in 516 ms. Result :sat
Minimization took 422 ms.
[2025-05-31 23:46:44] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:44] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:44] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2025-05-31 23:46:44] [INFO ] [Real]Added 436 Read/Feed constraints in 58 ms returned sat
[2025-05-31 23:46:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:44] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:44] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-05-31 23:46:44] [INFO ] [Nat]Added 436 Read/Feed constraints in 49 ms returned sat
[2025-05-31 23:46:44] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 87 ms.
[2025-05-31 23:46:46] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:46:46] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-05-31 23:46:46] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:46:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 415 ms
[2025-05-31 23:46:46] [INFO ] Added : 100 causal constraints over 20 iterations in 1796 ms. Result :sat
Minimization took 341 ms.
[2025-05-31 23:46:47] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:47] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2025-05-31 23:46:47] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-05-31 23:46:47] [INFO ] [Real]Added 436 Read/Feed constraints in 65 ms returned sat
[2025-05-31 23:46:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2025-05-31 23:46:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:46:47] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2025-05-31 23:46:47] [INFO ] [Nat]Added 436 Read/Feed constraints in 53 ms returned sat
[2025-05-31 23:46:47] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 104 ms.
[2025-05-31 23:46:48] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:46:49] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2025-05-31 23:46:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2025-05-31 23:46:49] [INFO ] Added : 100 causal constraints over 21 iterations in 1562 ms. Result :sat
Minimization took 340 ms.
[2025-05-31 23:46:49] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-05-31 23:46:49] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Real]Added 436 Read/Feed constraints in 84 ms returned sat
[2025-05-31 23:46:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 48 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2025-05-31 23:46:50] [INFO ] [Nat]Added 436 Read/Feed constraints in 53 ms returned sat
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:46:50] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2025-05-31 23:46:51] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 107 ms.
[2025-05-31 23:46:51] [INFO ] Added : 72 causal constraints over 15 iterations in 891 ms. Result :sat
Minimization took 338 ms.
[2025-05-31 23:46:52] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:52] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2025-05-31 23:46:52] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-05-31 23:46:52] [INFO ] [Real]Added 436 Read/Feed constraints in 77 ms returned sat
[2025-05-31 23:46:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:52] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-31 23:46:53] [INFO ] [Nat]Added 436 Read/Feed constraints in 50 ms returned sat
[2025-05-31 23:46:53] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2025-05-31 23:46:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-05-31 23:46:53] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 87 ms.
[2025-05-31 23:46:53] [INFO ] Added : 56 causal constraints over 12 iterations in 721 ms. Result :sat
Minimization took 355 ms.
[2025-05-31 23:46:54] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2025-05-31 23:46:54] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:46:54] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2025-05-31 23:46:54] [INFO ] [Real]Added 436 Read/Feed constraints in 72 ms returned sat
[2025-05-31 23:46:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:54] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:46:54] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2025-05-31 23:46:54] [INFO ] [Nat]Added 436 Read/Feed constraints in 52 ms returned sat
[2025-05-31 23:46:55] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 89 ms.
[2025-05-31 23:46:55] [INFO ] Added : 51 causal constraints over 11 iterations in 725 ms. Result :sat
Minimization took 355 ms.
[2025-05-31 23:46:56] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:46:56] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:46:56] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-05-31 23:46:56] [INFO ] [Real]Added 436 Read/Feed constraints in 74 ms returned sat
[2025-05-31 23:46:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:46:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 29 ms returned sat
[2025-05-31 23:46:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2025-05-31 23:46:56] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2025-05-31 23:46:56] [INFO ] [Nat]Added 436 Read/Feed constraints in 51 ms returned sat
[2025-05-31 23:46:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:46:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2025-05-31 23:46:57] [INFO ] Computed and/alt/rep : 877/1977/607 causal constraints (skipped 410 transitions) in 82 ms.
[2025-05-31 23:46:58] [INFO ] Added : 116 causal constraints over 24 iterations in 1367 ms. Result :sat
Minimization took 335 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 597 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 597/597 places, 3897/3897 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 596 transition count 3896
Applied a total of 2 rules in 170 ms. Remains 596 /597 variables (removed 1) and now considering 3896/3897 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 596/597 places, 3896/3897 transitions.
[2025-05-31 23:47:00] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
// Phase 1: matrix 1026 rows 596 cols
[2025-05-31 23:47:00] [INFO ] Computed 31 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2434 ms. (410 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3228 ms. (1858 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 23:47:06] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2025-05-31 23:47:06] [INFO ] Invariant cache hit.
[2025-05-31 23:47:06] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2025-05-31 23:47:06] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2025-05-31 23:47:06] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-05-31 23:47:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-05-31 23:47:06] [INFO ] [Real]Added 436 Read/Feed constraints in 59 ms returned sat
[2025-05-31 23:47:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:47:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:07] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-05-31 23:47:07] [INFO ] [Nat]Added 436 Read/Feed constraints in 50 ms returned sat
[2025-05-31 23:47:07] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-05-31 23:47:07] [INFO ] Computed and/alt/rep : 876/1976/606 causal constraints (skipped 410 transitions) in 103 ms.
[2025-05-31 23:47:08] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2025-05-31 23:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-05-31 23:47:08] [INFO ] Added : 110 causal constraints over 23 iterations in 1544 ms. Result :sat
Minimization took 305 ms.
[2025-05-31 23:47:09] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:09] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:09] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-05-31 23:47:09] [INFO ] [Real]Added 436 Read/Feed constraints in 97 ms returned sat
[2025-05-31 23:47:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:47:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:09] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2025-05-31 23:47:10] [INFO ] [Nat]Added 436 Read/Feed constraints in 55 ms returned sat
[2025-05-31 23:47:10] [INFO ] Computed and/alt/rep : 876/1976/606 causal constraints (skipped 410 transitions) in 106 ms.
[2025-05-31 23:47:10] [INFO ] Added : 56 causal constraints over 12 iterations in 776 ms. Result :sat
Minimization took 302 ms.
[2025-05-31 23:47:11] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:11] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:11] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-31 23:47:11] [INFO ] [Real]Added 436 Read/Feed constraints in 77 ms returned sat
[2025-05-31 23:47:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:47:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:11] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-31 23:47:11] [INFO ] [Nat]Added 436 Read/Feed constraints in 54 ms returned sat
[2025-05-31 23:47:12] [INFO ] Computed and/alt/rep : 876/1976/606 causal constraints (skipped 410 transitions) in 102 ms.
[2025-05-31 23:47:13] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:47:13] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:47:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2025-05-31 23:47:13] [INFO ] Added : 88 causal constraints over 18 iterations in 1332 ms. Result :sat
Minimization took 301 ms.
[2025-05-31 23:47:13] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:13] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:13] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2025-05-31 23:47:14] [INFO ] [Real]Added 436 Read/Feed constraints in 63 ms returned sat
[2025-05-31 23:47:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:47:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:14] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:14] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-05-31 23:47:14] [INFO ] [Nat]Added 436 Read/Feed constraints in 59 ms returned sat
[2025-05-31 23:47:14] [INFO ] Computed and/alt/rep : 876/1976/606 causal constraints (skipped 410 transitions) in 102 ms.
[2025-05-31 23:47:15] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-05-31 23:47:15] [INFO ] Added : 101 causal constraints over 21 iterations in 1436 ms. Result :sat
Minimization took 296 ms.
[2025-05-31 23:47:16] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:16] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:47:16] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2025-05-31 23:47:16] [INFO ] [Real]Added 436 Read/Feed constraints in 74 ms returned sat
[2025-05-31 23:47:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:47:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-05-31 23:47:17] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2025-05-31 23:47:17] [INFO ] [Nat]Added 436 Read/Feed constraints in 59 ms returned sat
[2025-05-31 23:47:17] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:47:17] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-05-31 23:47:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:47:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
[2025-05-31 23:47:17] [INFO ] Computed and/alt/rep : 876/1976/606 causal constraints (skipped 410 transitions) in 102 ms.
[2025-05-31 23:47:18] [INFO ] Added : 101 causal constraints over 21 iterations in 1294 ms. Result :sat
Minimization took 294 ms.
[2025-05-31 23:47:19] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:19] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:19] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-05-31 23:47:19] [INFO ] [Real]Added 436 Read/Feed constraints in 73 ms returned sat
[2025-05-31 23:47:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:47:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2025-05-31 23:47:19] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2025-05-31 23:47:19] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-31 23:47:19] [INFO ] [Nat]Added 436 Read/Feed constraints in 54 ms returned sat
[2025-05-31 23:47:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:47:20] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:47:20] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:47:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2025-05-31 23:47:20] [INFO ] Computed and/alt/rep : 876/1976/606 causal constraints (skipped 410 transitions) in 89 ms.
[2025-05-31 23:47:21] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2025-05-31 23:47:21] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2025-05-31 23:47:22] [INFO ] Added : 140 causal constraints over 29 iterations in 2016 ms. Result :sat
Minimization took 343 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3896/3896 transitions.
Applied a total of 0 rules in 144 ms. Remains 596 /596 variables (removed 0) and now considering 3896/3896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 596/596 places, 3896/3896 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3896/3896 transitions.
Applied a total of 0 rules in 141 ms. Remains 596 /596 variables (removed 0) and now considering 3896/3896 (removed 0) transitions.
[2025-05-31 23:47:24] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2025-05-31 23:47:24] [INFO ] Invariant cache hit.
[2025-05-31 23:47:24] [INFO ] Implicit Places using invariants in 701 ms returned []
[2025-05-31 23:47:24] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2025-05-31 23:47:24] [INFO ] Invariant cache hit.
[2025-05-31 23:47:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-05-31 23:47:28] [INFO ] Implicit Places using invariants and state equation in 3795 ms returned []
Implicit Place search using SMT with State Equation took 4501 ms to find 0 implicit places.
[2025-05-31 23:47:29] [INFO ] Redundant transitions in 221 ms returned []
Running 3886 sub problems to find dead transitions.
[2025-05-31 23:47:29] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2025-05-31 23:47:29] [INFO ] Invariant cache hit.
[2025-05-31 23:47:29] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3886 unsolved
SMT process timed out in 33369ms, After SMT, problems are : Problem set: 0 solved, 3886 unsolved
Search for dead transitions found 0 dead transitions in 33431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38364 ms. Remains : 596/596 places, 3896/3896 transitions.
RANDOM walk for 40000 steps (8 resets) in 1691 ms. (23 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
[2025-05-31 23:48:03] [INFO ] Flatten gal took : 501 ms
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
[2025-05-31 23:48:03] [INFO ] Flatten gal took : 206 ms
[2025-05-31 23:48:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15738139867712602741.gal : 70 ms
[2025-05-31 23:48:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12822897039473049828.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15738139867712602741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12822897039473049828.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12822897039473049828.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :9 after 25
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :25 after 26
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :26 after 33
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :33 after 85
Finished probabilistic random walk after 129336 steps, run visited all 12 properties in 2303 ms. (steps per millisecond=56 )
Probabilistic random walk after 129336 steps, saw 92178 distinct states, run finished after 2307 ms. (steps per millisecond=56 ) properties seen :12
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-10-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-10-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-10-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-10-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-10-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-10-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 141458 ms.

BK_STOP 1748735285848

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-174860079800102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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