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-165463872600189.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-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872600189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.0K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 9.9K May 30 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 30 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 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 17M 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-08a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654799145952

Running Version 202205111006
[2022-06-09 18:25:48] [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 18:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 18:25:50] [INFO ] Load time of PNML (sax parser for PT used): 1841 ms
[2022-06-09 18:25:50] [INFO ] Transformed 328 places.
[2022-06-09 18:25:50] [INFO ] Transformed 18744 transitions.
[2022-06-09 18:25:50] [INFO ] Found NUPN structural information;
[2022-06-09 18:25:50] [INFO ] Parsed PT model containing 328 places and 18744 transitions in 2269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Normalized transition count is 1422 out of 1449 initially.
// Phase 1: matrix 1422 rows 328 cols
[2022-06-09 18:25:51] [INFO ] Computed 10 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 16) seen :8
FORMULA StigmergyCommit-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :1
FORMULA StigmergyCommit-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :3
FORMULA StigmergyCommit-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-06-09 18:25:51] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2022-06-09 18:25:51] [INFO ] Computed 10 place invariants in 10 ms
[2022-06-09 18:25:52] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2022-06-09 18:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 18:25:52] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2022-06-09 18:25:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 18:25:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-06-09 18:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 18:25:53] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2022-06-09 18:25:53] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2022-06-09 18:25:54] [INFO ] [Nat]Added 1147 Read/Feed constraints in 585 ms returned sat
[2022-06-09 18:25:55] [INFO ] Deduced a trap composed of 16 places in 681 ms of which 8 ms to minimize.
[2022-06-09 18:25:56] [INFO ] Deduced a trap composed of 19 places in 832 ms of which 2 ms to minimize.
[2022-06-09 18:25:57] [INFO ] Deduced a trap composed of 18 places in 767 ms of which 2 ms to minimize.
[2022-06-09 18:25:57] [INFO ] Deduced a trap composed of 17 places in 407 ms of which 2 ms to minimize.
[2022-06-09 18:25:58] [INFO ] Deduced a trap composed of 16 places in 347 ms of which 0 ms to minimize.
[2022-06-09 18:25:58] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 0 ms to minimize.
[2022-06-09 18:25:58] [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.verifyPossible(DeadlockTester.java:918)
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 18:25:58] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-09 18:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 18:25:59] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2022-06-09 18:25:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 18:25:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-09 18:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 18:25:59] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-06-09 18:25:59] [INFO ] [Nat]Added 1147 Read/Feed constraints in 301 ms returned sat
[2022-06-09 18:26:00] [INFO ] Deduced a trap composed of 16 places in 662 ms of which 1 ms to minimize.
[2022-06-09 18:26:01] [INFO ] Deduced a trap composed of 19 places in 678 ms of which 2 ms to minimize.
[2022-06-09 18:26:02] [INFO ] Deduced a trap composed of 17 places in 605 ms of which 2 ms to minimize.
[2022-06-09 18:26:02] [INFO ] Deduced a trap composed of 19 places in 509 ms of which 1 ms to minimize.
[2022-06-09 18:26:03] [INFO ] Deduced a trap composed of 18 places in 414 ms of which 1 ms to minimize.
[2022-06-09 18:26:03] [INFO ] Deduced a trap composed of 18 places in 414 ms of which 0 ms to minimize.
[2022-06-09 18:26:04] [INFO ] Deduced a trap composed of 17 places in 647 ms of which 2 ms to minimize.
[2022-06-09 18:26:04] [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.verifyPossible(DeadlockTester.java:918)
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 18:26:04] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2022-06-09 18:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 18:26:05] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2022-06-09 18:26:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 18:26:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-09 18:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 18:26:05] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-06-09 18:26:05] [INFO ] [Nat]Added 1147 Read/Feed constraints in 342 ms returned sat
[2022-06-09 18:26:06] [INFO ] Deduced a trap composed of 19 places in 674 ms of which 1 ms to minimize.
[2022-06-09 18:26:07] [INFO ] Deduced a trap composed of 17 places in 724 ms of which 1 ms to minimize.
[2022-06-09 18:26:08] [INFO ] Deduced a trap composed of 17 places in 584 ms of which 1 ms to minimize.
[2022-06-09 18:26:08] [INFO ] Deduced a trap composed of 16 places in 506 ms of which 1 ms to minimize.
[2022-06-09 18:26:09] [INFO ] Deduced a trap composed of 19 places in 601 ms of which 1 ms to minimize.
[2022-06-09 18:26:10] [INFO ] Deduced a trap composed of 17 places in 494 ms of which 0 ms to minimize.
[2022-06-09 18:26:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:918)
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 18:26:10] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-09 18:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 18:26:10] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-09 18:26:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 18:26:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-06-09 18:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 18:26:11] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2022-06-09 18:26:12] [INFO ] [Nat]Added 1147 Read/Feed constraints in 527 ms returned sat
[2022-06-09 18:26:12] [INFO ] Deduced a trap composed of 19 places in 648 ms of which 1 ms to minimize.
[2022-06-09 18:26:13] [INFO ] Deduced a trap composed of 18 places in 533 ms of which 1 ms to minimize.
[2022-06-09 18:26:13] [INFO ] Deduced a trap composed of 17 places in 570 ms of which 2 ms to minimize.
[2022-06-09 18:26:14] [INFO ] Deduced a trap composed of 18 places in 712 ms of which 1 ms to minimize.
[2022-06-09 18:26:15] [INFO ] Deduced a trap composed of 17 places in 592 ms of which 1 ms to minimize.
[2022-06-09 18:26:16] [INFO ] Deduced a trap composed of 18 places in 491 ms of which 1 ms to minimize.
[2022-06-09 18:26: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 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.verifyPossible(DeadlockTester.java:918)
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] Max seen :[0, 0, 0, 0]
Support contains 4 out of 328 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 320 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.39 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 320 transition count 1358
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 100 rules applied. Total rules applied 184 place count 265 transition count 1313
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 193 place count 256 transition count 1313
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 193 place count 256 transition count 1252
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 315 place count 195 transition count 1252
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 361 place count 149 transition count 1206
Iterating global reduction 3 with 46 rules applied. Total rules applied 407 place count 149 transition count 1206
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 452 place count 104 transition count 1161
Iterating global reduction 3 with 45 rules applied. Total rules applied 497 place count 104 transition count 1161
Ensure Unique test removed 520 transitions
Reduce isomorphic transitions removed 520 transitions.
Iterating post reduction 3 with 520 rules applied. Total rules applied 1017 place count 104 transition count 641
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1025 place count 96 transition count 633
Iterating global reduction 4 with 8 rules applied. Total rules applied 1033 place count 96 transition count 633
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1040 place count 89 transition count 626
Iterating global reduction 4 with 7 rules applied. Total rules applied 1047 place count 89 transition count 626
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1053 place count 89 transition count 620
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1085 place count 73 transition count 604
Drop transitions removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1099 place count 73 transition count 590
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1107 place count 65 transition count 582
Iterating global reduction 6 with 8 rules applied. Total rules applied 1115 place count 65 transition count 582
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1123 place count 57 transition count 574
Iterating global reduction 6 with 8 rules applied. Total rules applied 1131 place count 57 transition count 574
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1139 place count 49 transition count 566
Iterating global reduction 6 with 8 rules applied. Total rules applied 1147 place count 49 transition count 566
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1149 place count 49 transition count 564
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1153 place count 49 transition count 564
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1155 place count 49 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1156 place count 48 transition count 561
Reduce places removed 1 places and 0 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 6 with 9 rules applied. Total rules applied 1165 place count 47 transition count 553
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1173 place count 39 transition count 553
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1173 place count 39 transition count 551
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 1177 place count 37 transition count 551
Performed 11 Post agglomeration using F-continuation condition with reduction of 500 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1199 place count 26 transition count 40
Drop transitions removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1210 place count 26 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 19 rules applied. Total rules applied 1229 place count 14 transition count 22
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1236 place count 14 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1237 place count 14 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1238 place count 14 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1239 place count 14 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1241 place count 12 transition count 11
Applied a total of 1241 rules in 1051 ms. Remains 12 /328 variables (removed 316) and now considering 11/1449 (removed 1438) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/328 places, 11/1449 transitions.
// Phase 1: matrix 11 rows 12 cols
[2022-06-09 18:26:17] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 83126 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 4) seen :4
FORMULA StigmergyCommit-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29483 ms.

BK_STOP 1654799178145

--------------------
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-08a"
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-08a, 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-165463872600189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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