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.r536-tall-171690531700149.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 StigmergyCommit-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 StigmergyCommit-PT-05b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717230659219

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:31:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 08:31:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:31:00] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-06-01 08:31:00] [INFO ] Transformed 1837 places.
[2024-06-01 08:31:00] [INFO ] Transformed 3460 transitions.
[2024-06-01 08:31:00] [INFO ] Found NUPN structural information;
[2024-06-01 08:31:00] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3460 rows 1837 cols
[2024-06-01 08:31:00] [INFO ] Computed 7 invariants in 101 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 (89 resets) in 54 ms. (181 steps per ms)
FORMULA StigmergyCommit-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (100 resets) in 82 ms. (843 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 08:31:01] [INFO ] Invariant cache hit.
[2024-06-01 08:31:01] [INFO ] [Real]Absence check using 7 positive place invariants in 38 ms returned sat
[2024-06-01 08:31:02] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2024-06-01 08:31:03] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 290 ms.
[2024-06-01 08:31:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 38 ms returned sat
[2024-06-01 08:31:05] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2024-06-01 08:31:05] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 222 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-01 08:31:09] [INFO ] [Real]Absence check using 7 positive place invariants in 32 ms returned sat
[2024-06-01 08:31:10] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2024-06-01 08:31:10] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 193 ms.
[2024-06-01 08:31:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 36 ms returned sat
[2024-06-01 08:31:12] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2024-06-01 08:31:12] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 192 ms.
[2024-06-01 08:31:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
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 08:31:16] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2024-06-01 08:31:17] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2024-06-01 08:31:18] [INFO ] Deduced a trap composed of 400 places in 1064 ms of which 83 ms to minimize.
[2024-06-01 08:31:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 43 ms returned sat
[2024-06-01 08:31:19] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2024-06-01 08:31:20] [INFO ] Deduced a trap composed of 400 places in 977 ms of which 10 ms to minimize.
[2024-06-01 08:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1173 ms
[2024-06-01 08:31:21] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 180 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 08:31:23] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2024-06-01 08:31:24] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2024-06-01 08:31:25] [INFO ] Deduced a trap composed of 401 places in 951 ms of which 11 ms to minimize.
[2024-06-01 08:31:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 32 ms returned sat
[2024-06-01 08:31:27] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2024-06-01 08:31:28] [INFO ] Deduced a trap composed of 401 places in 939 ms of which 9 ms to minimize.
[2024-06-01 08:31:29] [INFO ] Deduced a trap composed of 400 places in 961 ms of which 10 ms to minimize.
[2024-06-01 08:31:30] [INFO ] Deduced a trap composed of 400 places in 957 ms of which 9 ms to minimize.
[2024-06-01 08:31:31] [INFO ] Deduced a trap composed of 400 places in 952 ms of which 9 ms to minimize.
[2024-06-01 08:31: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 08:31:31] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2024-06-01 08:31:32] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2024-06-01 08:31:33] [INFO ] Deduced a trap composed of 400 places in 955 ms of which 10 ms to minimize.
[2024-06-01 08:31:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 33 ms returned sat
[2024-06-01 08:31:34] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2024-06-01 08:31:35] [INFO ] Deduced a trap composed of 400 places in 977 ms of which 10 ms to minimize.
[2024-06-01 08:31:36] [INFO ] Deduced a trap composed of 398 places in 837 ms of which 8 ms to minimize.
[2024-06-01 08:31:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2095 ms
[2024-06-01 08:31:36] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 195 ms.
[2024-06-01 08:31: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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
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 08:31:38] [INFO ] [Real]Absence check using 7 positive place invariants in 32 ms returned sat
[2024-06-01 08:31:39] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2024-06-01 08:31:40] [INFO ] Deduced a trap composed of 400 places in 973 ms of which 12 ms to minimize.
[2024-06-01 08:31:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 34 ms returned sat
[2024-06-01 08:31:42] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2024-06-01 08:31:43] [INFO ] Deduced a trap composed of 400 places in 980 ms of which 10 ms to minimize.
[2024-06-01 08:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1164 ms
[2024-06-01 08:31:43] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 197 ms.
[2024-06-01 08:31: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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
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 08:31:46] [INFO ] [Real]Absence check using 7 positive place invariants in 30 ms returned sat
[2024-06-01 08:31:47] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2024-06-01 08:31:48] [INFO ] Deduced a trap composed of 492 places in 987 ms of which 10 ms to minimize.
[2024-06-01 08:31:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:31:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 34 ms returned sat
[2024-06-01 08:31:49] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2024-06-01 08:31:50] [INFO ] Deduced a trap composed of 492 places in 982 ms of which 9 ms to minimize.
[2024-06-01 08:31:51] [INFO ] Deduced a trap composed of 396 places in 844 ms of which 7 ms to minimize.
[2024-06-01 08:31:52] [INFO ] Deduced a trap composed of 400 places in 754 ms of which 7 ms to minimize.
[2024-06-01 08:31:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2959 ms
[2024-06-01 08:31:52] [INFO ] Computed and/alt/rep : 3285/11000/3285 causal constraints (skipped 174 transitions) in 191 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
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 1837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1812 edges and 1837 vertex of which 126 / 1837 are part of one of the 18 SCC in 15 ms
Free SCC test removed 108 places
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 2721 edges and 1729 vertex of which 1717 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.20 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1370 transitions
Trivial Post-agglo rules discarded 1370 transitions
Performed 1370 trivial Post agglomeration. Transition count delta: 1370
Iterating post reduction 0 with 1376 rules applied. Total rules applied 1378 place count 1717 transition count 1940
Reduce places removed 1370 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 1414 rules applied. Total rules applied 2792 place count 347 transition count 1896
Reduce places removed 17 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 23 rules applied. Total rules applied 2815 place count 330 transition count 1890
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2821 place count 324 transition count 1890
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 2821 place count 324 transition count 1827
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 2947 place count 261 transition count 1827
Discarding 70 places :
Symmetric choice reduction at 4 with 70 rule applications. Total rules 3017 place count 191 transition count 1757
Iterating global reduction 4 with 70 rules applied. Total rules applied 3087 place count 191 transition count 1757
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 3125 place count 153 transition count 427
Iterating global reduction 4 with 38 rules applied. Total rules applied 3163 place count 153 transition count 427
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 3178 place count 153 transition count 412
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 3190 place count 141 transition count 400
Iterating global reduction 5 with 12 rules applied. Total rules applied 3202 place count 141 transition count 400
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 3214 place count 129 transition count 388
Iterating global reduction 5 with 12 rules applied. Total rules applied 3226 place count 129 transition count 388
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 3238 place count 129 transition count 376
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 3276 place count 110 transition count 357
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3277 place count 110 transition count 356
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3283 place count 104 transition count 350
Iterating global reduction 7 with 6 rules applied. Total rules applied 3289 place count 104 transition count 350
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3295 place count 98 transition count 344
Iterating global reduction 7 with 6 rules applied. Total rules applied 3301 place count 98 transition count 344
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3307 place count 92 transition count 338
Iterating global reduction 7 with 6 rules applied. Total rules applied 3313 place count 92 transition count 338
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3321 place count 88 transition count 346
Free-agglomeration rule applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 3358 place count 88 transition count 309
Reduce places removed 37 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 70 rules applied. Total rules applied 3428 place count 51 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 103 transitions
Redundant transition composition rules discarded 103 transitions
Iterating global reduction 8 with 103 rules applied. Total rules applied 3531 place count 51 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3533 place count 50 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3537 place count 48 transition count 190
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 3545 place count 48 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3548 place count 48 transition count 187
Applied a total of 3548 rules in 346 ms. Remains 48 /1837 variables (removed 1789) and now considering 187/3460 (removed 3273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 48/1837 places, 187/3460 transitions.
// Phase 1: matrix 187 rows 48 cols
[2024-06-01 08:31:53] [INFO ] Computed 7 invariants in 2 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 3931 ms. (254 steps per ms)
FORMULA StigmergyCommit-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 436 ms. (2288 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 58011 ms.
ITS solved all properties within timeout

BK_STOP 1717230718372

--------------------
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="StigmergyCommit-PT-05b"
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 StigmergyCommit-PT-05b, 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 r536-tall-171690531700149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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