Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761600653.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-030B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 569K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717258320046

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:12:01] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-06-01 16:12:01] [INFO ] Transformed 2343 places.
[2024-06-01 16:12:01] [INFO ] Transformed 2133 transitions.
[2024-06-01 16:12:01] [INFO ] Found NUPN structural information;
[2024-06-01 16:12:01] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 2133 rows 2343 cols
[2024-06-01 16:12:01] [INFO ] Computed 331 invariants in 45 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 92 ms. (107 steps per ms)
FORMULA ShieldPPPt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-01 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]
[2024-06-01 16:12:01] [INFO ] Invariant cache hit.
[2024-06-01 16:12:02] [INFO ] [Real]Absence check using 331 positive place invariants in 132 ms returned sat
[2024-06-01 16:12:03] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2024-06-01 16:12:04] [INFO ] Deduced a trap composed of 24 places in 895 ms of which 93 ms to minimize.
[2024-06-01 16:12:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:05] [INFO ] [Nat]Absence check using 331 positive place invariants in 130 ms returned sat
[2024-06-01 16:12:05] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2024-06-01 16:12:06] [INFO ] Deduced a trap composed of 24 places in 654 ms of which 11 ms to minimize.
[2024-06-01 16:12:07] [INFO ] Deduced a trap composed of 29 places in 626 ms of which 11 ms to minimize.
[2024-06-01 16:12:08] [INFO ] Deduced a trap composed of 21 places in 632 ms of which 11 ms to minimize.
[2024-06-01 16:12:08] [INFO ] Deduced a trap composed of 27 places in 590 ms of which 10 ms to minimize.
[2024-06-01 16:12:09] [INFO ] Deduced a trap composed of 26 places in 605 ms of which 10 ms to minimize.
[2024-06-01 16:12:10] [INFO ] Deduced a trap composed of 25 places in 562 ms of which 11 ms to minimize.
[2024-06-01 16:12: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 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)
[2024-06-01 16:12:10] [INFO ] [Real]Absence check using 331 positive place invariants in 125 ms returned sat
[2024-06-01 16:12:11] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2024-06-01 16:12:12] [INFO ] Deduced a trap composed of 26 places in 663 ms of which 10 ms to minimize.
[2024-06-01 16:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:12] [INFO ] [Nat]Absence check using 331 positive place invariants in 133 ms returned sat
[2024-06-01 16:12:13] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-06-01 16:12:14] [INFO ] Deduced a trap composed of 26 places in 703 ms of which 11 ms to minimize.
[2024-06-01 16:12:15] [INFO ] Deduced a trap composed of 18 places in 631 ms of which 10 ms to minimize.
[2024-06-01 16:12:15] [INFO ] Deduced a trap composed of 26 places in 691 ms of which 11 ms to minimize.
[2024-06-01 16:12:16] [INFO ] Deduced a trap composed of 17 places in 681 ms of which 15 ms to minimize.
[2024-06-01 16:12:17] [INFO ] Deduced a trap composed of 23 places in 639 ms of which 11 ms to minimize.
[2024-06-01 16:12:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:12:17] [INFO ] [Real]Absence check using 331 positive place invariants in 124 ms returned sat
[2024-06-01 16:12:18] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-06-01 16:12:19] [INFO ] Deduced a trap composed of 26 places in 620 ms of which 10 ms to minimize.
[2024-06-01 16:12:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:19] [INFO ] [Nat]Absence check using 331 positive place invariants in 119 ms returned sat
[2024-06-01 16:12:20] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2024-06-01 16:12:21] [INFO ] Deduced a trap composed of 26 places in 639 ms of which 10 ms to minimize.
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 18 places in 611 ms of which 10 ms to minimize.
[2024-06-01 16:12:22] [INFO ] Deduced a trap composed of 40 places in 668 ms of which 11 ms to minimize.
[2024-06-01 16:12:23] [INFO ] Deduced a trap composed of 23 places in 662 ms of which 10 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 19 places in 638 ms of which 11 ms to minimize.
[2024-06-01 16:12:24] [INFO ] Deduced a trap composed of 22 places in 620 ms of which 10 ms to minimize.
[2024-06-01 16:12:24] [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)
[2024-06-01 16:12:25] [INFO ] [Real]Absence check using 331 positive place invariants in 133 ms returned sat
[2024-06-01 16:12:26] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2024-06-01 16:12:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:26] [INFO ] [Nat]Absence check using 331 positive place invariants in 120 ms returned sat
[2024-06-01 16:12:27] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2024-06-01 16:12:28] [INFO ] Deduced a trap composed of 22 places in 736 ms of which 12 ms to minimize.
[2024-06-01 16:12:29] [INFO ] Deduced a trap composed of 20 places in 748 ms of which 11 ms to minimize.
[2024-06-01 16:12:29] [INFO ] Deduced a trap composed of 26 places in 675 ms of which 11 ms to minimize.
[2024-06-01 16:12:30] [INFO ] Deduced a trap composed of 29 places in 686 ms of which 11 ms to minimize.
[2024-06-01 16:12:31] [INFO ] Deduced a trap composed of 23 places in 669 ms of which 12 ms to minimize.
[2024-06-01 16:12:31] [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)
[2024-06-01 16:12:31] [INFO ] [Real]Absence check using 331 positive place invariants in 125 ms returned sat
[2024-06-01 16:12:32] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-06-01 16:12:33] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 10 ms to minimize.
[2024-06-01 16:12:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 116 ms returned sat
[2024-06-01 16:12:34] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-06-01 16:12:35] [INFO ] Deduced a trap composed of 22 places in 608 ms of which 10 ms to minimize.
[2024-06-01 16:12:35] [INFO ] Deduced a trap composed of 19 places in 595 ms of which 10 ms to minimize.
[2024-06-01 16:12:36] [INFO ] Deduced a trap composed of 18 places in 594 ms of which 12 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 32 places in 572 ms of which 9 ms to minimize.
[2024-06-01 16:12:37] [INFO ] Deduced a trap composed of 36 places in 566 ms of which 10 ms to minimize.
[2024-06-01 16:12:38] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 9 ms to minimize.
[2024-06-01 16:12:38] [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)
[2024-06-01 16:12:38] [INFO ] [Real]Absence check using 331 positive place invariants in 131 ms returned sat
[2024-06-01 16:12:39] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2024-06-01 16:12:40] [INFO ] Deduced a trap composed of 26 places in 720 ms of which 11 ms to minimize.
[2024-06-01 16:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:41] [INFO ] [Nat]Absence check using 331 positive place invariants in 116 ms returned sat
[2024-06-01 16:12:41] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2024-06-01 16:12:42] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 12 ms to minimize.
[2024-06-01 16:12:43] [INFO ] Deduced a trap composed of 24 places in 679 ms of which 11 ms to minimize.
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 22 places in 693 ms of which 11 ms to minimize.
[2024-06-01 16:12:44] [INFO ] Deduced a trap composed of 21 places in 698 ms of which 11 ms to minimize.
[2024-06-01 16:12:45] [INFO ] Deduced a trap composed of 31 places in 672 ms of which 11 ms to minimize.
[2024-06-01 16:12:46] [INFO ] Deduced a trap composed of 30 places in 635 ms of which 10 ms to minimize.
[2024-06-01 16:12:46] [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)
[2024-06-01 16:12:46] [INFO ] [Real]Absence check using 331 positive place invariants in 125 ms returned sat
[2024-06-01 16:12:47] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2024-06-01 16:12:48] [INFO ] Deduced a trap composed of 20 places in 667 ms of which 11 ms to minimize.
[2024-06-01 16:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:12:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 128 ms returned sat
[2024-06-01 16:12:49] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-06-01 16:12:50] [INFO ] Deduced a trap composed of 20 places in 672 ms of which 10 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 40 places in 694 ms of which 11 ms to minimize.
[2024-06-01 16:12:51] [INFO ] Deduced a trap composed of 36 places in 680 ms of which 12 ms to minimize.
[2024-06-01 16:12:52] [INFO ] Deduced a trap composed of 46 places in 666 ms of which 11 ms to minimize.
[2024-06-01 16:12:53] [INFO ] Deduced a trap composed of 22 places in 627 ms of which 10 ms to minimize.
[2024-06-01 16:12:54] [INFO ] Deduced a trap composed of 23 places in 605 ms of which 10 ms to minimize.
[2024-06-01 16:12: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 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 570 transitions
Trivial Post-agglo rules discarded 570 transitions
Performed 570 trivial Post agglomeration. Transition count delta: 570
Iterating post reduction 0 with 570 rules applied. Total rules applied 570 place count 2343 transition count 1563
Reduce places removed 570 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 572 rules applied. Total rules applied 1142 place count 1773 transition count 1561
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 1145 place count 1772 transition count 1559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1147 place count 1770 transition count 1559
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 1147 place count 1770 transition count 1439
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1387 place count 1650 transition count 1439
Discarding 207 places :
Symmetric choice reduction at 4 with 207 rule applications. Total rules 1594 place count 1443 transition count 1232
Iterating global reduction 4 with 207 rules applied. Total rules applied 1801 place count 1443 transition count 1232
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 88 Pre rules applied. Total rules applied 1801 place count 1443 transition count 1144
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1977 place count 1355 transition count 1144
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 3 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 4 with 1020 rules applied. Total rules applied 2997 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 3175 place count 756 transition count 634
Partial Free-agglomeration rule applied 86 times.
Drop transitions (Partial Free agglomeration) removed 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 3261 place count 756 transition count 634
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3262 place count 755 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3263 place count 754 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3263 place count 754 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3267 place count 752 transition count 631
Applied a total of 3267 rules in 699 ms. Remains 752 /2343 variables (removed 1591) and now considering 631/2133 (removed 1502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 709 ms. Remains : 752/2343 places, 631/2133 transitions.
// Phase 1: matrix 631 rows 752 cols
[2024-06-01 16:12:54] [INFO ] Computed 330 invariants in 4 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 5944 ms. (168 steps per ms)
FORMULA ShieldPPPt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 7918 ms. (252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 16:13:08] [INFO ] Invariant cache hit.
[2024-06-01 16:13:08] [INFO ] [Real]Absence check using 330 positive place invariants in 43 ms returned sat
[2024-06-01 16:13:08] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-06-01 16:13:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:13:08] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:13:09] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2024-06-01 16:13:09] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-06-01 16:13:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:13:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2024-06-01 16:13:09] [INFO ] Computed and/alt/rep : 627/1460/627 causal constraints (skipped 0 transitions) in 39 ms.
[2024-06-01 16:13:16] [INFO ] Added : 597 causal constraints over 120 iterations in 6624 ms. Result :sat
Minimization took 380 ms.
[2024-06-01 16:13:16] [INFO ] [Real]Absence check using 330 positive place invariants in 42 ms returned sat
[2024-06-01 16:13:17] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-06-01 16:13:17] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:13:17] [INFO ] [Nat]Absence check using 330 positive place invariants in 42 ms returned sat
[2024-06-01 16:13:17] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-01 16:13:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:17] [INFO ] Computed and/alt/rep : 627/1460/627 causal constraints (skipped 0 transitions) in 33 ms.
[2024-06-01 16:13:24] [INFO ] Added : 599 causal constraints over 121 iterations in 7048 ms. Result :sat
Minimization took 445 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 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 631/631 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 748 transition count 627
Applied a total of 8 rules in 64 ms. Remains 748 /752 variables (removed 4) and now considering 627/631 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 748/752 places, 627/631 transitions.
// Phase 1: matrix 627 rows 748 cols
[2024-06-01 16:13:25] [INFO ] Computed 330 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 5674 ms. (176 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 7499 ms. (266 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 16:13:39] [INFO ] Invariant cache hit.
[2024-06-01 16:13:39] [INFO ] [Real]Absence check using 330 positive place invariants in 43 ms returned sat
[2024-06-01 16:13:39] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-06-01 16:13:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:13:39] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:13:39] [INFO ] [Nat]Absence check using 330 positive place invariants in 44 ms returned sat
[2024-06-01 16:13:39] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-06-01 16:13:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:39] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-01 16:13:39] [INFO ] Computed and/alt/rep : 623/1462/623 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 16:13:46] [INFO ] Added : 597 causal constraints over 120 iterations in 6570 ms. Result :sat
Minimization took 405 ms.
[2024-06-01 16:13:47] [INFO ] [Real]Absence check using 330 positive place invariants in 42 ms returned sat
[2024-06-01 16:13:47] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-01 16:13:47] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:13:47] [INFO ] [Nat]Absence check using 330 positive place invariants in 41 ms returned sat
[2024-06-01 16:13:47] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-06-01 16:13:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:13:47] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-06-01 16:13:47] [INFO ] Computed and/alt/rep : 623/1462/623 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 16:13:53] [INFO ] Added : 598 causal constraints over 120 iterations in 6228 ms. Result :sat
Minimization took 549 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 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 26 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 748/748 places, 627/627 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 627/627 transitions.
Applied a total of 0 rules in 16 ms. Remains 748 /748 variables (removed 0) and now considering 627/627 (removed 0) transitions.
[2024-06-01 16:13:54] [INFO ] Invariant cache hit.
[2024-06-01 16:13:55] [INFO ] Implicit Places using invariants in 373 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 375 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 746/748 places, 627/627 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 744 transition count 625
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 24 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2024-06-01 16:13:55] [INFO ] Computed 328 invariants in 2 ms
[2024-06-01 16:13:55] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 16:13:55] [INFO ] Invariant cache hit.
[2024-06-01 16:13:56] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 744/748 places, 625/627 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1416 ms. Remains : 744/748 places, 625/627 transitions.
[2024-06-01 16:13:56] [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 5610 ms. (178 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 7416 ms. (269 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 16:14:09] [INFO ] Invariant cache hit.
[2024-06-01 16:14:09] [INFO ] [Real]Absence check using 328 positive place invariants in 43 ms returned sat
[2024-06-01 16:14:09] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-06-01 16:14:09] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:14:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:14:09] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2024-06-01 16:14:10] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:14:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2024-06-01 16:14:10] [INFO ] Computed and/alt/rep : 621/1449/621 causal constraints (skipped 0 transitions) in 28 ms.
[2024-06-01 16:14:16] [INFO ] Added : 574 causal constraints over 116 iterations in 5831 ms. Result :sat
Minimization took 267 ms.
[2024-06-01 16:14:16] [INFO ] [Real]Absence check using 328 positive place invariants in 42 ms returned sat
[2024-06-01 16:14:16] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-01 16:14:16] [INFO ] Computed and/alt/rep : 621/1449/621 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 16:14:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:14:17] [INFO ] [Nat]Absence check using 328 positive place invariants in 47 ms returned sat
[2024-06-01 16:14:17] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-06-01 16:14:17] [INFO ] Computed and/alt/rep : 621/1449/621 causal constraints (skipped 0 transitions) in 32 ms.
[2024-06-01 16:14:23] [INFO ] Added : 595 causal constraints over 120 iterations in 6607 ms. Result :sat
Minimization took 400 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:[1, 1] Max Struct:[1, 1]
Support contains 2 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 625/625 transitions.
Applied a total of 0 rules in 14 ms. Remains 744 /744 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 744/744 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 625/625 transitions.
Applied a total of 0 rules in 13 ms. Remains 744 /744 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2024-06-01 16:14:25] [INFO ] Invariant cache hit.
[2024-06-01 16:14:25] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 16:14:25] [INFO ] Invariant cache hit.
[2024-06-01 16:14:26] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2024-06-01 16:14:26] [INFO ] Redundant transitions in 26 ms returned []
Running 621 sub problems to find dead transitions.
[2024-06-01 16:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 326/326 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 16:14:33] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 10 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:14:35] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 4 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:14:36] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 5 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:14:37] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/742 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:14:38] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-06-01 16:14:43] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:14:43] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 16:14:43] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 12/358 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 1.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 1.0)
(s676 0.0)
(s677 1.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 1.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 timeout
1.0)
(s726 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/742 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 621 unsolved
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31251 ms. Remains : 744/744 places, 625/625 transitions.
[2024-06-01 16:14:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[1, 1]
FORMULA ShieldPPPt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 5610 ms. (178 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 180992 ms.
ITS solved all properties within timeout

BK_STOP 1717258502192

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

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

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-030B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-030B, 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 r528-tall-171683761600653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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