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.r209-tall-174894546800115.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 ShieldPPPt-PT-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-tall-174894546800115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 762K May 29 14:33 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 ShieldPPPt-PT-040B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020692159

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:04:53] [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-06-04 07:04:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:04:53] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2025-06-04 07:04:53] [INFO ] Transformed 3123 places.
[2025-06-04 07:04:53] [INFO ] Transformed 2843 transitions.
[2025-06-04 07:04:53] [INFO ] Found NUPN structural information;
[2025-06-04 07:04:53] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 420 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]
// Phase 1: matrix 2843 rows 3123 cols
[2025-06-04 07:04:54] [INFO ] Computed 441 invariants in 56 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 113 ms. (87 steps per ms)
FORMULA ShieldPPPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (14 resets) in 98 ms. (707 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-06-04 07:04:54] [INFO ] Invariant cache hit.
[2025-06-04 07:04:55] [INFO ] [Real]Absence check using 441 positive place invariants in 214 ms returned sat
[2025-06-04 07:04:56] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2025-06-04 07:04:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 189 ms returned sat
[2025-06-04 07:04:58] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2025-06-04 07:05:00] [INFO ] Deduced a trap composed of 28 places in 1599 ms of which 138 ms to minimize.
[2025-06-04 07:05:01] [INFO ] Deduced a trap composed of 20 places in 1490 ms of which 19 ms to minimize.
[2025-06-04 07:05:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-06-04 07:05:02] [INFO ] [Real]Absence check using 441 positive place invariants in 191 ms returned sat
[2025-06-04 07:05:03] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2025-06-04 07:05:05] [INFO ] Deduced a trap composed of 19 places in 1406 ms of which 28 ms to minimize.
[2025-06-04 07:05:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:05] [INFO ] [Nat]Absence check using 441 positive place invariants in 185 ms returned sat
[2025-06-04 07:05:06] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2025-06-04 07:05:08] [INFO ] Deduced a trap composed of 19 places in 1312 ms of which 16 ms to minimize.
[2025-06-04 07:05:09] [INFO ] Deduced a trap composed of 20 places in 1245 ms of which 17 ms to minimize.
[2025-06-04 07:05:11] [INFO ] Deduced a trap composed of 31 places in 1275 ms of which 17 ms to minimize.
[2025-06-04 07:05:11] [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-06-04 07:05:11] [INFO ] [Real]Absence check using 441 positive place invariants in 187 ms returned sat
[2025-06-04 07:05:12] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2025-06-04 07:05:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 184 ms returned sat
[2025-06-04 07:05:14] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2025-06-04 07:05:16] [INFO ] Deduced a trap composed of 19 places in 1407 ms of which 21 ms to minimize.
[2025-06-04 07:05:17] [INFO ] Deduced a trap composed of 28 places in 1430 ms of which 18 ms to minimize.
[2025-06-04 07:05:19] [INFO ] Deduced a trap composed of 26 places in 1430 ms of which 18 ms to minimize.
[2025-06-04 07:05:19] [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-06-04 07:05:19] [INFO ] [Real]Absence check using 441 positive place invariants in 184 ms returned sat
[2025-06-04 07:05:20] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2025-06-04 07:05:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:21] [INFO ] [Nat]Absence check using 441 positive place invariants in 187 ms returned sat
[2025-06-04 07:05:22] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2025-06-04 07:05:24] [INFO ] Deduced a trap composed of 22 places in 1363 ms of which 16 ms to minimize.
[2025-06-04 07:05:25] [INFO ] Deduced a trap composed of 18 places in 1435 ms of which 18 ms to minimize.
[2025-06-04 07:05:27] [INFO ] Deduced a trap composed of 20 places in 1438 ms of which 16 ms to minimize.
[2025-06-04 07:05:27] [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-06-04 07:05:27] [INFO ] [Real]Absence check using 441 positive place invariants in 180 ms returned sat
[2025-06-04 07:05:28] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2025-06-04 07:05:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:29] [INFO ] [Nat]Absence check using 441 positive place invariants in 180 ms returned sat
[2025-06-04 07:05:30] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2025-06-04 07:05:32] [INFO ] Deduced a trap composed of 26 places in 1403 ms of which 17 ms to minimize.
[2025-06-04 07:05:33] [INFO ] Deduced a trap composed of 20 places in 1389 ms of which 18 ms to minimize.
[2025-06-04 07:05:35] [INFO ] Deduced a trap composed of 21 places in 1349 ms of which 17 ms to minimize.
[2025-06-04 07:05: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 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-06-04 07:05:35] [INFO ] [Real]Absence check using 441 positive place invariants in 178 ms returned sat
[2025-06-04 07:05:36] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2025-06-04 07:05:38] [INFO ] Deduced a trap composed of 28 places in 1464 ms of which 18 ms to minimize.
[2025-06-04 07:05:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:39] [INFO ] [Nat]Absence check using 441 positive place invariants in 189 ms returned sat
[2025-06-04 07:05:40] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2025-06-04 07:05:41] [INFO ] Deduced a trap composed of 28 places in 1433 ms of which 17 ms to minimize.
[2025-06-04 07:05:43] [INFO ] Deduced a trap composed of 22 places in 1424 ms of which 17 ms to minimize.
[2025-06-04 07:05:44] [INFO ] Deduced a trap composed of 31 places in 1395 ms of which 18 ms to minimize.
[2025-06-04 07:05:44] [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-06-04 07:05:45] [INFO ] [Real]Absence check using 441 positive place invariants in 183 ms returned sat
[2025-06-04 07:05:46] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2025-06-04 07:05:48] [INFO ] Deduced a trap composed of 18 places in 1409 ms of which 17 ms to minimize.
[2025-06-04 07:05:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 182 ms returned sat
[2025-06-04 07:05:50] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2025-06-04 07:05:51] [INFO ] Deduced a trap composed of 18 places in 1422 ms of which 18 ms to minimize.
[2025-06-04 07:05:53] [INFO ] Deduced a trap composed of 31 places in 1400 ms of which 18 ms to minimize.
[2025-06-04 07:05:54] [INFO ] Deduced a trap composed of 28 places in 1321 ms of which 15 ms to minimize.
[2025-06-04 07:05:54] [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)
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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 760 transitions
Trivial Post-agglo rules discarded 760 transitions
Performed 760 trivial Post agglomeration. Transition count delta: 760
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 3123 transition count 2083
Reduce places removed 760 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 762 rules applied. Total rules applied 1522 place count 2363 transition count 2081
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 1525 place count 2362 transition count 2079
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1527 place count 2360 transition count 2079
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 160 Pre rules applied. Total rules applied 1527 place count 2360 transition count 1919
Deduced a syphon composed of 160 places in 4 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 320 rules applied. Total rules applied 1847 place count 2200 transition count 1919
Discarding 278 places :
Symmetric choice reduction at 4 with 278 rule applications. Total rules 2125 place count 1922 transition count 1641
Iterating global reduction 4 with 278 rules applied. Total rules applied 2403 place count 1922 transition count 1641
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 119 Pre rules applied. Total rules applied 2403 place count 1922 transition count 1522
Deduced a syphon composed of 119 places in 8 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 2641 place count 1803 transition count 1522
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 3 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 4 with 1354 rules applied. Total rules applied 3995 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4197 place count 1025 transition count 845
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 4229 place count 1009 transition count 845
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4230 place count 1009 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4231 place count 1008 transition count 844
Partial Free-agglomeration rule applied 119 times.
Drop transitions (Partial Free agglomeration) removed 119 transitions
Iterating global reduction 5 with 119 rules applied. Total rules applied 4350 place count 1008 transition count 844
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4351 place count 1007 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4352 place count 1006 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4352 place count 1006 transition count 841
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4356 place count 1004 transition count 841
Applied a total of 4356 rules in 1116 ms. Remains 1004 /3123 variables (removed 2119) and now considering 841/2843 (removed 2002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1128 ms. Remains : 1004/3123 places, 841/2843 transitions.
// Phase 1: matrix 841 rows 1004 cols
[2025-06-04 07:05:55] [INFO ] Computed 440 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 6953 ms. (143 steps per ms)
FORMULA ShieldPPPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (8 resets) in 18878 ms. (211 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-04 07:06:21] [INFO ] Invariant cache hit.
[2025-06-04 07:06:21] [INFO ] [Real]Absence check using 440 positive place invariants in 66 ms returned sat
[2025-06-04 07:06:21] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-04 07:06:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:06:21] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:06:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:22] [INFO ] [Nat]Absence check using 440 positive place invariants in 59 ms returned sat
[2025-06-04 07:06:22] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-04 07:06:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:06:22] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2025-06-04 07:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2025-06-04 07:06:22] [INFO ] Computed and/alt/rep : 837/1971/837 causal constraints (skipped 0 transitions) in 43 ms.
[2025-06-04 07:06:34] [INFO ] Added : 787 causal constraints over 158 iterations in 11730 ms. Result :sat
Minimization took 1191 ms.
[2025-06-04 07:06:35] [INFO ] [Real]Absence check using 440 positive place invariants in 61 ms returned sat
[2025-06-04 07:06:36] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-04 07:06:36] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:06:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:36] [INFO ] [Nat]Absence check using 440 positive place invariants in 60 ms returned sat
[2025-06-04 07:06:36] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-06-04 07:06:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:06:36] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2025-06-04 07:06:36] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2025-06-04 07:06:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2025-06-04 07:06:36] [INFO ] Computed and/alt/rep : 837/1971/837 causal constraints (skipped 0 transitions) in 40 ms.
[2025-06-04 07:06:48] [INFO ] Added : 799 causal constraints over 160 iterations in 11808 ms. Result :sat
Minimization took 642 ms.
[2025-06-04 07:06:49] [INFO ] [Real]Absence check using 440 positive place invariants in 61 ms returned sat
[2025-06-04 07:06:49] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-04 07:06:49] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-04 07:06:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:50] [INFO ] [Nat]Absence check using 440 positive place invariants in 60 ms returned sat
[2025-06-04 07:06:50] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2025-06-04 07:06:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:06:50] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2025-06-04 07:06:50] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2025-06-04 07:06:50] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 3 ms to minimize.
[2025-06-04 07:06:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 416 ms
[2025-06-04 07:06:50] [INFO ] Computed and/alt/rep : 837/1971/837 causal constraints (skipped 0 transitions) in 46 ms.
[2025-06-04 07:07:04] [INFO ] Added : 800 causal constraints over 160 iterations in 14029 ms. Result :sat
Minimization took 1153 ms.
[2025-06-04 07:07:06] [INFO ] [Real]Absence check using 440 positive place invariants in 66 ms returned sat
[2025-06-04 07:07:06] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-04 07:07:06] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:07:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:07:06] [INFO ] [Nat]Absence check using 440 positive place invariants in 65 ms returned sat
[2025-06-04 07:07:06] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2025-06-04 07:07:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:07:07] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2025-06-04 07:07:07] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2025-06-04 07:07:07] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2025-06-04 07:07:07] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2025-06-04 07:07:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 508 ms
[2025-06-04 07:07:07] [INFO ] Computed and/alt/rep : 837/1971/837 causal constraints (skipped 0 transitions) in 45 ms.
[2025-06-04 07:07:20] [INFO ] Added : 812 causal constraints over 163 iterations in 12619 ms. Result :sat
Minimization took 714 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ShieldPPPt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 841/841 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1000 transition count 837
Applied a total of 8 rules in 211 ms. Remains 1000 /1004 variables (removed 4) and now considering 837/841 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 1000/1004 places, 837/841 transitions.
// Phase 1: matrix 837 rows 1000 cols
[2025-06-04 07:07:23] [INFO ] Computed 440 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 1]
FORMULA ShieldPPPt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 6799 ms. (147 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 9418 ms. (212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-04 07:07:39] [INFO ] Invariant cache hit.
[2025-06-04 07:07:39] [INFO ] [Real]Absence check using 440 positive place invariants in 65 ms returned sat
[2025-06-04 07:07:40] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-04 07:07:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:07:40] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:07:40] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2025-06-04 07:07:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:07:40] [INFO ] [Nat]Absence check using 440 positive place invariants in 63 ms returned sat
[2025-06-04 07:07:40] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-06-04 07:07:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:07:40] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 3 ms to minimize.
[2025-06-04 07:07:41] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2025-06-04 07:07:41] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2025-06-04 07:07:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2025-06-04 07:07:41] [INFO ] Computed and/alt/rep : 833/1971/833 causal constraints (skipped 0 transitions) in 46 ms.
[2025-06-04 07:07:52] [INFO ] Added : 783 causal constraints over 157 iterations in 10824 ms. Result :sat
Minimization took 3488 ms.
[2025-06-04 07:07:55] [INFO ] [Real]Absence check using 440 positive place invariants in 65 ms returned sat
[2025-06-04 07:07:56] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-04 07:07:56] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:07:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:07:56] [INFO ] [Nat]Absence check using 440 positive place invariants in 65 ms returned sat
[2025-06-04 07:07:56] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2025-06-04 07:07:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:07:56] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2025-06-04 07:07:56] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2025-06-04 07:07:56] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2025-06-04 07:07:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 363 ms
[2025-06-04 07:07:57] [INFO ] Computed and/alt/rep : 833/1971/833 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-04 07:08:07] [INFO ] Added : 774 causal constraints over 156 iterations in 10590 ms. Result :sat
Minimization took 820 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 837/837 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1000 transition count 836
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 999 transition count 836
Applied a total of 2 rules in 38 ms. Remains 999 /1000 variables (removed 1) and now considering 836/837 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 999/1000 places, 836/837 transitions.
// Phase 1: matrix 836 rows 999 cols
[2025-06-04 07:08:09] [INFO ] Computed 440 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (3 resets) in 6721 ms. (148 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 9438 ms. (211 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-04 07:08:25] [INFO ] Invariant cache hit.
[2025-06-04 07:08:26] [INFO ] [Real]Absence check using 440 positive place invariants in 58 ms returned sat
[2025-06-04 07:08:26] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2025-06-04 07:08:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:08:26] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:08:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:08:26] [INFO ] [Nat]Absence check using 440 positive place invariants in 66 ms returned sat
[2025-06-04 07:08:26] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-04 07:08:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:08:27] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 3 ms to minimize.
[2025-06-04 07:08:27] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2025-06-04 07:08:27] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2025-06-04 07:08:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2025-06-04 07:08:27] [INFO ] Computed and/alt/rep : 832/1970/832 causal constraints (skipped 0 transitions) in 45 ms.
[2025-06-04 07:08:39] [INFO ] Added : 803 causal constraints over 162 iterations in 12007 ms. Result :sat
Minimization took 1544 ms.
[2025-06-04 07:08:41] [INFO ] [Real]Absence check using 440 positive place invariants in 64 ms returned sat
[2025-06-04 07:08:41] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-04 07:08:41] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:08:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:08:41] [INFO ] [Nat]Absence check using 440 positive place invariants in 64 ms returned sat
[2025-06-04 07:08:41] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2025-06-04 07:08:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:08:42] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2025-06-04 07:08:42] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2025-06-04 07:08:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2025-06-04 07:08:42] [INFO ] Computed and/alt/rep : 832/1970/832 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-04 07:08:53] [INFO ] Added : 795 causal constraints over 159 iterations in 11646 ms. Result :sat
Minimization took 1297 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 836/836 transitions.
Applied a total of 0 rules in 22 ms. Remains 999 /999 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 999/999 places, 836/836 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 836/836 transitions.
Applied a total of 0 rules in 20 ms. Remains 999 /999 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2025-06-04 07:08:56] [INFO ] Invariant cache hit.
[2025-06-04 07:08:57] [INFO ] Implicit Places using invariants in 514 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 516 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 997/999 places, 836/836 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 995 transition count 834
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 995 transition count 834
Applied a total of 4 rules in 37 ms. Remains 995 /997 variables (removed 2) and now considering 834/836 (removed 2) transitions.
// Phase 1: matrix 834 rows 995 cols
[2025-06-04 07:08:57] [INFO ] Computed 438 invariants in 8 ms
[2025-06-04 07:08:57] [INFO ] Implicit Places using invariants in 521 ms returned []
[2025-06-04 07:08:57] [INFO ] Invariant cache hit.
[2025-06-04 07:08:58] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 995/999 places, 834/836 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2017 ms. Remains : 995/999 places, 834/836 transitions.
[2025-06-04 07:08:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 7195 ms. (138 steps per ms)
BEST_FIRST walk for 1982867 steps (4 resets) in 10002 ms. (198 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-04 07:09:16] [INFO ] Invariant cache hit.
[2025-06-04 07:09:16] [INFO ] [Real]Absence check using 438 positive place invariants in 63 ms returned sat
[2025-06-04 07:09:16] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-06-04 07:09:16] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2025-06-04 07:09:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:09:16] [INFO ] [Nat]Absence check using 438 positive place invariants in 66 ms returned sat
[2025-06-04 07:09:17] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-06-04 07:09:17] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2025-06-04 07:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-06-04 07:09:17] [INFO ] Computed and/alt/rep : 830/1957/830 causal constraints (skipped 0 transitions) in 43 ms.
[2025-06-04 07:09:28] [INFO ] Added : 794 causal constraints over 160 iterations in 11153 ms. Result :sat
Minimization took 3756 ms.
[2025-06-04 07:09:32] [INFO ] [Real]Absence check using 438 positive place invariants in 72 ms returned sat
[2025-06-04 07:09:32] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-06-04 07:09:32] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 3 ms to minimize.
[2025-06-04 07:09:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:09:33] [INFO ] [Nat]Absence check using 438 positive place invariants in 64 ms returned sat
[2025-06-04 07:09:33] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-06-04 07:09:33] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2025-06-04 07:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-06-04 07:09:33] [INFO ] Computed and/alt/rep : 830/1957/830 causal constraints (skipped 0 transitions) in 40 ms.
[2025-06-04 07:09:43] [INFO ] Added : 784 causal constraints over 157 iterations in 10404 ms. Result :sat
Minimization took 629 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 834/834 transitions.
Applied a total of 0 rules in 19 ms. Remains 995 /995 variables (removed 0) and now considering 834/834 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 995/995 places, 834/834 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 834/834 transitions.
Applied a total of 0 rules in 19 ms. Remains 995 /995 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2025-06-04 07:09:46] [INFO ] Invariant cache hit.
[2025-06-04 07:09:46] [INFO ] Implicit Places using invariants in 513 ms returned []
[2025-06-04 07:09:46] [INFO ] Invariant cache hit.
[2025-06-04 07:09:47] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2025-06-04 07:09:47] [INFO ] Redundant transitions in 42 ms returned []
Running 830 sub problems to find dead transitions.
[2025-06-04 07:09:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/993 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2025-06-04 07:09:59] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2025-06-04 07:10:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2025-06-04 07:10:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2025-06-04 07:10:00] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2025-06-04 07:10:00] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2025-06-04 07:10:00] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2025-06-04 07:10:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
[2025-06-04 07:10:04] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 4 ms to minimize.
[2025-06-04 07:10:04] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2025-06-04 07:10:04] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 4 ms to minimize.
[2025-06-04 07:10:04] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2025-06-04 07:10:04] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 3 ms to minimize.
[2025-06-04 07:10:05] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 4 ms to minimize.
[2025-06-04 07:10:05] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 3 ms to minimize.
[2025-06-04 07:10:05] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 3 ms to minimize.
[2025-06-04 07:10:05] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 4 ms to minimize.
[2025-06-04 07:10:05] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 4 ms to minimize.
[2025-06-04 07:10:05] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 4 ms to minimize.
[2025-06-04 07:10:06] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 4 ms to minimize.
[2025-06-04 07:10:06] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/993 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2025-06-04 07:10:15] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2025-06-04 07:10:16] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2025-06-04 07:10:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/1829 variables, and 469 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 436/438 constraints, State Equation: 0/995 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/993 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/993 variables, 33/469 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:19] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2025-06-04 07:10:20] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2025-06-04 07:10:21] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/993 variables, 20/489 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2025-06-04 07:10:22] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2025-06-04 07:10:22] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2025-06-04 07:10:22] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2025-06-04 07:10:23] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2025-06-04 07:10:23] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2025-06-04 07:10:23] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2025-06-04 07:10:23] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2025-06-04 07:10:23] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2025-06-04 07:10:23] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2025-06-04 07:10:24] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2025-06-04 07:10:24] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2025-06-04 07:10:24] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2025-06-04 07:10:24] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2025-06-04 07:10:24] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2025-06-04 07:10:24] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2025-06-04 07:10:25] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2025-06-04 07:10:25] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2025-06-04 07:10:25] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2025-06-04 07:10:25] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2025-06-04 07:10:25] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/993 variables, 20/509 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2025-06-04 07:10:27] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2025-06-04 07:10:28] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2025-06-04 07:10:28] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2025-06-04 07:10:29] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2025-06-04 07:10:29] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2025-06-04 07:10:29] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2025-06-04 07:10:29] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2025-06-04 07:10:29] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 3 ms to minimize.
[2025-06-04 07:10:30] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2025-06-04 07:10:30] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 3 ms to minimize.
[2025-06-04 07:10:30] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2025-06-04 07:10:30] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2025-06-04 07:10:30] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:10:31] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2025-06-04 07:10:31] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2025-06-04 07:10:31] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 3 ms to minimize.
[2025-06-04 07:10:31] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2025-06-04 07:10:31] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2025-06-04 07:10:31] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 3 ms to minimize.
[2025-06-04 07:10:36] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/993 variables, 20/529 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2025-06-04 07:10:40] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2025-06-04 07:10:41] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/1829 variables, and 531 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 436/438 constraints, State Equation: 0/995 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 95/95 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61792 ms. Remains : 995/995 places, 834/834 transitions.
RANDOM walk for 40000 steps (8 resets) in 1295 ms. (30 steps per ms) remains 4/4 properties
[2025-06-04 07:10:48] [INFO ] Flatten gal took : 193 ms
BEST_FIRST walk for 40002 steps (8 resets) in 512 ms. (77 steps per ms) remains 4/4 properties
[2025-06-04 07:10:48] [INFO ] Flatten gal took : 84 ms
[2025-06-04 07:10:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality872301476260680818.gal : 38 ms
[2025-06-04 07:10:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10973283595625625555.prop : 0 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/ReachabilityCardinality872301476260680818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10973283595625625555.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 ...328
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality10973283595625625555.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 28
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :28 after 54
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :54 after 103
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :103 after 393
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :393 after 4307
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4307 after 145582
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :145582 after 4.26299e+06
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.26299e+06 after 1.75438e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.75438e+08 after 2.63788e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.63788e+09 after 2.21257e+11
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.21257e+11 after 5.08985e+13
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.08985e+13 after 6.31018e+18
Interrupted probabilistic random walk after 117118 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 4
Probabilistic random walk after 117118 steps, saw 95351 distinct states, run finished after 3012 ms. (steps per millisecond=38 ) properties seen :0
[2025-06-04 07:10:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/28 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/30 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/34 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 20/54 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 45/99 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/99 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/103 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/103 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/103 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 8/111 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/111 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 47/158 variables, 29/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/158 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/158 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/159 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/159 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/159 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (OVERLAPS) 51/210 variables, 27/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/210 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/210 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 4/214 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/214 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/214 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 4/218 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/218 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 35/253 variables, 21/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/253 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/253 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 49/302 variables, 25/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/302 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/302 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 4/306 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/306 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/306 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 4/310 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/310 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
After SMT solving in domain Real declared 345/1829 variables, and 256 constraints, problems are : Problem set: 2 solved, 0 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 72/438 constraints, State Equation: 184/995 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ShieldPPPt-PT-040B-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldPPPt-PT-040B-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 358793 ms.

BK_STOP 1749021052250

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, 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 r209-tall-174894546800115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 ;