Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872400101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 30 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 30 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 30 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 30 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 25 13:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 231K May 29 12:20 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-02b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654767986459

Running Version 202205111006
[2022-06-09 09:46:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 09:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 09:46:28] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-06-09 09:46:28] [INFO ] Transformed 928 places.
[2022-06-09 09:46:28] [INFO ] Transformed 1040 transitions.
[2022-06-09 09:46:28] [INFO ] Found NUPN structural information;
[2022-06-09 09:46:28] [INFO ] Parsed PT model containing 928 places and 1040 transitions in 420 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 1040 rows 928 cols
[2022-06-09 09:46:28] [INFO ] Computed 4 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 169 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :8
FORMULA StigmergyCommit-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
// Phase 1: matrix 1040 rows 928 cols
[2022-06-09 09:46:29] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 09:46:29] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-06-09 09:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:30] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2022-06-09 09:46:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:46:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-06-09 09:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:31] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2022-06-09 09:46:31] [INFO ] Deduced a trap composed of 397 places in 535 ms of which 19 ms to minimize.
[2022-06-09 09:46:32] [INFO ] Deduced a trap composed of 397 places in 387 ms of which 2 ms to minimize.
[2022-06-09 09:46:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1171 ms
[2022-06-09 09:46:32] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 111 ms.
[2022-06-09 09:46:35] [INFO ] Deduced a trap composed of 20 places in 610 ms of which 3 ms to minimize.
[2022-06-09 09:46:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 09:46:36] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-06-09 09:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:36] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2022-06-09 09:46:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:46:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-06-09 09:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:37] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2022-06-09 09:46:38] [INFO ] Deduced a trap composed of 397 places in 502 ms of which 4 ms to minimize.
[2022-06-09 09:46:38] [INFO ] Deduced a trap composed of 400 places in 494 ms of which 2 ms to minimize.
[2022-06-09 09:46:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1187 ms
[2022-06-09 09:46:38] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 83 ms.
[2022-06-09 09:46:42] [INFO ] Deduced a trap composed of 20 places in 527 ms of which 2 ms to minimize.
[2022-06-09 09:46:42] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 09:46:42] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2022-06-09 09:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:43] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2022-06-09 09:46:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:46:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-06-09 09:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:44] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2022-06-09 09:46:44] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 78 ms.
[2022-06-09 09:46:49] [INFO ] Deduced a trap composed of 20 places in 821 ms of which 2 ms to minimize.
[2022-06-09 09:46:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 09:46:49] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2022-06-09 09:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:50] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2022-06-09 09:46:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:46:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 36 ms returned sat
[2022-06-09 09:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:51] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2022-06-09 09:46:51] [INFO ] Deduced a trap composed of 401 places in 615 ms of which 1 ms to minimize.
[2022-06-09 09:46:52] [INFO ] Deduced a trap composed of 423 places in 447 ms of which 1 ms to minimize.
[2022-06-09 09:46:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1278 ms
[2022-06-09 09:46:52] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 124 ms.
[2022-06-09 09:46:55] [INFO ] Deduced a trap composed of 20 places in 554 ms of which 1 ms to minimize.
[2022-06-09 09:46:55] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 09:46:56] [INFO ] [Real]Absence check using 4 positive place invariants in 31 ms returned sat
[2022-06-09 09:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:56] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2022-06-09 09:46:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:46:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 34 ms returned sat
[2022-06-09 09:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:46:57] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2022-06-09 09:46:58] [INFO ] Deduced a trap composed of 397 places in 657 ms of which 2 ms to minimize.
[2022-06-09 09:46:58] [INFO ] Deduced a trap composed of 397 places in 422 ms of which 1 ms to minimize.
[2022-06-09 09:46:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1288 ms
[2022-06-09 09:46:58] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 107 ms.
[2022-06-09 09:47:01] [INFO ] Added : 185 causal constraints over 37 iterations in 2841 ms. Result :unknown
[2022-06-09 09:47:01] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2022-06-09 09:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:47:02] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2022-06-09 09:47:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:47:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-06-09 09:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:47:03] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2022-06-09 09:47:04] [INFO ] Deduced a trap composed of 396 places in 738 ms of which 1 ms to minimize.
[2022-06-09 09:47:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 870 ms
[2022-06-09 09:47:04] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 93 ms.
[2022-06-09 09:47:07] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 09:47:07] [INFO ] [Real]Absence check using 4 positive place invariants in 32 ms returned sat
[2022-06-09 09:47:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:47:08] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2022-06-09 09:47:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:47:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 21 ms returned sat
[2022-06-09 09:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:47:09] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2022-06-09 09:47:10] [INFO ] Deduced a trap composed of 396 places in 691 ms of which 1 ms to minimize.
[2022-06-09 09:47:11] [INFO ] Deduced a trap composed of 397 places in 637 ms of which 1 ms to minimize.
[2022-06-09 09:47:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1558 ms
[2022-06-09 09:47:11] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 303 ms.
[2022-06-09 09:47:14] [INFO ] Deduced a trap composed of 20 places in 656 ms of which 2 ms to minimize.
[2022-06-09 09:47:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 09:47:14] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2022-06-09 09:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:47:15] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2022-06-09 09:47:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:47:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 33 ms returned sat
[2022-06-09 09:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:47:16] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2022-06-09 09:47:16] [INFO ] Deduced a trap composed of 398 places in 703 ms of which 2 ms to minimize.
[2022-06-09 09:47:17] [INFO ] Deduced a trap composed of 396 places in 677 ms of which 2 ms to minimize.
[2022-06-09 09:47:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1629 ms
[2022-06-09 09:47:17] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 119 ms.
[2022-06-09 09:47:21] [INFO ] Deduced a trap composed of 20 places in 900 ms of which 2 ms to minimize.
[2022-06-09 09:47:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 928 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 908 edges and 928 vertex of which 60 / 928 are part of one of the 8 SCC in 13 ms
Free SCC test removed 52 places
Drop transitions removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 1176 edges and 876 vertex of which 872 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 688 rules applied. Total rules applied 690 place count 872 transition count 284
Reduce places removed 686 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 705 rules applied. Total rules applied 1395 place count 186 transition count 265
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 1409 place count 178 transition count 259
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1415 place count 172 transition count 259
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1415 place count 172 transition count 231
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1471 place count 144 transition count 231
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 1509 place count 106 transition count 193
Iterating global reduction 4 with 38 rules applied. Total rules applied 1547 place count 106 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1547 place count 106 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1549 place count 105 transition count 192
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1570 place count 84 transition count 134
Iterating global reduction 4 with 21 rules applied. Total rules applied 1591 place count 84 transition count 134
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1601 place count 84 transition count 124
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1605 place count 80 transition count 120
Iterating global reduction 5 with 4 rules applied. Total rules applied 1609 place count 80 transition count 120
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1613 place count 76 transition count 116
Iterating global reduction 5 with 4 rules applied. Total rules applied 1617 place count 76 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1621 place count 76 transition count 112
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1643 place count 65 transition count 101
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1644 place count 65 transition count 100
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1647 place count 62 transition count 97
Iterating global reduction 7 with 3 rules applied. Total rules applied 1650 place count 62 transition count 97
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1653 place count 59 transition count 94
Iterating global reduction 7 with 3 rules applied. Total rules applied 1656 place count 59 transition count 94
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1659 place count 56 transition count 91
Iterating global reduction 7 with 3 rules applied. Total rules applied 1662 place count 56 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1668 place count 53 transition count 101
Free-agglomeration rule applied 20 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1688 place count 53 transition count 78
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 1714 place count 33 transition count 72
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1717 place count 30 transition count 69
Iterating global reduction 8 with 3 rules applied. Total rules applied 1720 place count 30 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1721 place count 30 transition count 68
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1737 place count 30 transition count 52
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1742 place count 30 transition count 52
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1744 place count 30 transition count 50
Applied a total of 1744 rules in 200 ms. Remains 30 /928 variables (removed 898) and now considering 50/1040 (removed 990) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/928 places, 50/1040 transitions.
// Phase 1: matrix 50 rows 30 cols
[2022-06-09 09:47:21] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 7) seen :7
FORMULA StigmergyCommit-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 54470 ms.

BK_STOP 1654768042841

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-02b, 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 r294-smll-165463872400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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