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.r492-smll-171636267000501.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636267000501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 103K Apr 11 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 11 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 375K Apr 11 20:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 20:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 52K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 226K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 233K Apr 11 21:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 21:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 818K Apr 11 21:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 11 21:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.7M May 18 16:42 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 FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717278069469

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:41:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 21:41:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:41:12] [INFO ] Load time of PNML (sax parser for PT used): 784 ms
[2024-06-01 21:41:12] [INFO ] Transformed 12194 places.
[2024-06-01 21:41:12] [INFO ] Transformed 10560 transitions.
[2024-06-01 21:41:12] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 1065 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 10560 rows 12177 cols
[2024-06-01 21:41:13] [INFO ] Computed 2768 invariants in 968 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] Max Struct:[+inf, +inf, 106, +inf, +inf, +inf, +inf, 1, 1, 5, 1, +inf, 1, 1, 7]
RANDOM walk for 10000 steps (3 resets) in 469 ms. (21 steps per ms)
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (24 resets) in 526 ms. (227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[23, 51, 2, 6, 9, 11, 10, 1, 10, 0, 0, 1] Max Struct:[+inf, +inf, 106, +inf, +inf, +inf, +inf, 5, +inf, 1, 1, 7]
[2024-06-01 21:41:15] [INFO ] Invariant cache hit.
[2024-06-01 21:41:20] [INFO ] [Real]Absence check using 149 positive place invariants in 625 ms returned sat
[2024-06-01 21:41:21] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1075 ms returned unsat
[2024-06-01 21:41:24] [INFO ] [Real]Absence check using 149 positive place invariants in 558 ms returned unsat
[2024-06-01 21:41:27] [INFO ] [Real]Absence check using 149 positive place invariants in 524 ms returned sat
[2024-06-01 21:41:29] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1480 ms returned sat
[2024-06-01 21:41:29] [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: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 21:41:32] [INFO ] [Real]Absence check using 149 positive place invariants in 572 ms returned sat
[2024-06-01 21:41:34] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1732 ms returned sat
[2024-06-01 21:41:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 21:41:38] [INFO ] [Real]Absence check using 149 positive place invariants in 656 ms returned sat
[2024-06-01 21:41:39] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1404 ms returned sat
[2024-06-01 21:41:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 21:41:42] [INFO ] [Real]Absence check using 149 positive place invariants in 545 ms returned sat
[2024-06-01 21:41:44] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1518 ms returned sat
[2024-06-01 21:41:44] [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: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 21:41:47] [INFO ] [Real]Absence check using 149 positive place invariants in 597 ms returned sat
[2024-06-01 21:41:48] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 555 ms returned unsat
[2024-06-01 21:41:54] [INFO ] [Real]Absence check using 149 positive place invariants in 625 ms returned sat
[2024-06-01 21:41:55] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1618 ms returned sat
[2024-06-01 21:41:56] [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: Broken pipe")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 21:41:58] [INFO ] [Real]Absence check using 149 positive place invariants in 588 ms returned sat
[2024-06-01 21:42:00] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1885 ms returned sat
[2024-06-01 21:42: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 10
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.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 21:42:03] [INFO ] [Real]Absence check using 149 positive place invariants in 554 ms returned sat
[2024-06-01 21:42:05] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1398 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[23, 51, 2, 6, 9, 11, 10, 1, 10, 0, 0, 1] Max Struct:[+inf, 51, 2, +inf, +inf, +inf, +inf, 1, +inf, 1, 1, 1]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[23, 6, 9, 11, 10, 10, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, 1, 1]
Support contains 1125 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 10465 are kept as prefixes of interest. Removing 1712 places using SCC suffix rule.36 ms
Discarding 1712 places :
Also discarding 1635 output transitions
Drop transitions (Output transitions of discarded places.) removed 1635 transitions
Discarding 1530 places :
Implicit places reduction removed 1530 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2907 transitions
Trivial Post-agglo rules discarded 2907 transitions
Performed 2907 trivial Post agglomeration. Transition count delta: 2907
Iterating post reduction 0 with 4437 rules applied. Total rules applied 4438 place count 8935 transition count 6018
Reduce places removed 2907 places and 0 transitions.
Performed 560 Post agglomeration using F-continuation condition.Transition count delta: 560
Iterating post reduction 1 with 3467 rules applied. Total rules applied 7905 place count 6028 transition count 5458
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 2 with 560 rules applied. Total rules applied 8465 place count 5468 transition count 5458
Performed 663 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 663 Pre rules applied. Total rules applied 8465 place count 5468 transition count 4795
Deduced a syphon composed of 663 places in 11 ms
Ensure Unique test removed 306 places
Reduce places removed 969 places and 0 transitions.
Iterating global reduction 3 with 1632 rules applied. Total rules applied 10097 place count 4499 transition count 4795
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 10250 place count 4499 transition count 4642
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 10403 place count 4346 transition count 4642
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 10403 place count 4346 transition count 4591
Deduced a syphon composed of 51 places in 9 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 10505 place count 4295 transition count 4591
Discarding 815 places :
Symmetric choice reduction at 5 with 815 rule applications. Total rules 11320 place count 3480 transition count 3776
Iterating global reduction 5 with 815 rules applied. Total rules applied 12135 place count 3480 transition count 3776
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 5 with 510 rules applied. Total rules applied 12645 place count 3378 transition count 3368
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 6 with 306 rules applied. Total rules applied 12951 place count 3072 transition count 3368
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 50 Pre rules applied. Total rules applied 12951 place count 3072 transition count 3318
Deduced a syphon composed of 50 places in 6 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 13051 place count 3022 transition count 3318
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 13052 place count 3021 transition count 3267
Iterating global reduction 7 with 1 rules applied. Total rules applied 13053 place count 3021 transition count 3267
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 13104 place count 3021 transition count 3216
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 4 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 8 with 255 rules applied. Total rules applied 13359 place count 2868 transition count 3114
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13461 place count 2817 transition count 3063
Free-agglomeration rule (complex) applied 357 times.
Iterating global reduction 8 with 357 rules applied. Total rules applied 13818 place count 2817 transition count 2806
Ensure Unique test removed 50 places
Reduce places removed 407 places and 0 transitions.
Iterating post reduction 8 with 407 rules applied. Total rules applied 14225 place count 2410 transition count 2806
Applied a total of 14225 rules in 3107 ms. Remains 2410 /12177 variables (removed 9767) and now considering 2806/10560 (removed 7754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3125 ms. Remains : 2410/12177 places, 2806/10560 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 2806 rows 2410 cols
[2024-06-01 21:42:12] [INFO ] Computed 411 invariants in 102 ms
Current structural bounds on expressions (after invariants) : Max Seen:[23, 6, 9, 11, 10, 10, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, 1, 1]
RANDOM walk for 887915 steps (1551 resets) in 30001 ms. (29 steps per ms)
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4702979 steps (117 resets) in 25712 ms. (182 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51, 51, 51, 51, 51, 17] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 21:43:08] [INFO ] Invariant cache hit.
[2024-06-01 21:43:08] [INFO ] [Real]Absence check using 0 positive and 411 generalized place invariants in 154 ms returned sat
[2024-06-01 21:43:10] [INFO ] [Real]Absence check using state equation in 1220 ms returned unsat
[2024-06-01 21:43:10] [INFO ] [Real]Absence check using 0 positive and 411 generalized place invariants in 144 ms returned sat
[2024-06-01 21:43:11] [INFO ] [Real]Absence check using state equation in 1253 ms returned unsat
[2024-06-01 21:43:12] [INFO ] [Real]Absence check using 0 positive and 411 generalized place invariants in 134 ms returned sat
[2024-06-01 21:43:14] [INFO ] [Real]Absence check using state equation in 1736 ms returned unsat
[2024-06-01 21:43:14] [INFO ] [Real]Absence check using 0 positive and 411 generalized place invariants in 136 ms returned sat
[2024-06-01 21:43:15] [INFO ] [Real]Absence check using state equation in 1266 ms returned unsat
[2024-06-01 21:43:16] [INFO ] [Real]Absence check using 0 positive and 411 generalized place invariants in 232 ms returned sat
[2024-06-01 21:43:18] [INFO ] [Real]Absence check using state equation in 1626 ms returned unsat
[2024-06-01 21:43:18] [INFO ] [Real]Absence check using 0 positive and 411 generalized place invariants in 211 ms returned sat
[2024-06-01 21:43:20] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2024-06-01 21:43:21] [INFO ] Computed and/alt/rep : 1892/5056/1892 causal constraints (skipped 608 transitions) in 480 ms.
[2024-06-01 21:43:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:43:23] [INFO ] [Nat]Absence check using 0 positive and 411 generalized place invariants in 143 ms returned sat
[2024-06-01 21:43:24] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2024-06-01 21:43:25] [INFO ] Computed and/alt/rep : 1892/5056/1892 causal constraints (skipped 608 transitions) in 433 ms.
[2024-06-01 21:43:45] [INFO ] Added : 320 causal constraints over 64 iterations in 20074 ms.(timeout) Result :sat
Minimization took 4308 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51, 51, 51, 51, 51, 17] Max Struct:[51, 51, 51, 51, 51, +inf]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[+inf]
Support contains 1 out of 2410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2806/2806 transitions.
Graph (complete) has 5307 edges and 2410 vertex of which 1838 are kept as prefixes of interest. Removing 572 places using SCC suffix rule.2 ms
Discarding 572 places :
Also discarding 817 output transitions
Drop transitions (Output transitions of discarded places.) removed 817 transitions
Drop transitions (Empty/Sink Transition effects.) removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 969 transitions
Trivial Post-agglo rules discarded 969 transitions
Performed 969 trivial Post agglomeration. Transition count delta: 969
Iterating post reduction 0 with 1530 rules applied. Total rules applied 1531 place count 1532 transition count 765
Reduce places removed 969 places and 0 transitions.
Iterating post reduction 1 with 969 rules applied. Total rules applied 2500 place count 563 transition count 765
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 2500 place count 563 transition count 714
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 2602 place count 512 transition count 714
Discarding 254 places :
Symmetric choice reduction at 2 with 254 rule applications. Total rules 2856 place count 258 transition count 460
Iterating global reduction 2 with 254 rules applied. Total rules applied 3110 place count 258 transition count 460
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 2 with 204 rules applied. Total rules applied 3314 place count 258 transition count 256
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 3364 place count 208 transition count 206
Iterating global reduction 3 with 50 rules applied. Total rules applied 3414 place count 208 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3414 place count 208 transition count 205
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3416 place count 207 transition count 205
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 3467 place count 207 transition count 205
Applied a total of 3467 rules in 57 ms. Remains 207 /2410 variables (removed 2203) and now considering 205/2806 (removed 2601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 207/2410 places, 205/2806 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 205 rows 207 cols
[2024-06-01 21:43:50] [INFO ] Computed 52 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[51]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (9588 resets) in 7464 ms. (133 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 4 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 166761 ms.
ITS solved all properties within timeout

BK_STOP 1717278238292

--------------------
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="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r492-smll-171636267000501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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