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.r305-smll-165463878400115.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 gold2021
Input is StigmergyElection-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.9K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 30 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 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 428K 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 StigmergyElection-PT-05b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654730980908

Running Version 0
[2022-06-08 23:29:43] [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-08 23:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:29:43] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2022-06-08 23:29:43] [INFO ] Transformed 699 places.
[2022-06-08 23:29:43] [INFO ] Transformed 1266 transitions.
[2022-06-08 23:29:43] [INFO ] Found NUPN structural information;
[2022-06-08 23:29:43] [INFO ] Parsed PT model containing 699 places and 1266 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 1266 rows 699 cols
[2022-06-08 23:29:44] [INFO ] Computed 6 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 115 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :9
FORMULA StigmergyElection-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
// Phase 1: matrix 1266 rows 699 cols
[2022-06-08 23:29:44] [INFO ] Computed 6 place invariants in 17 ms
[2022-06-08 23:29:44] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2022-06-08 23:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:29:45] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2022-06-08 23:29:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:29:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2022-06-08 23:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:29:46] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2022-06-08 23:29:47] [INFO ] Deduced a trap composed of 159 places in 692 ms of which 9 ms to minimize.
[2022-06-08 23:29:47] [INFO ] Deduced a trap composed of 189 places in 557 ms of which 2 ms to minimize.
[2022-06-08 23:29:48] [INFO ] Deduced a trap composed of 174 places in 652 ms of which 2 ms to minimize.
[2022-06-08 23:29:49] [INFO ] Deduced a trap composed of 191 places in 581 ms of which 1 ms to minimize.
[2022-06-08 23:29:49] [INFO ] Deduced a trap composed of 191 places in 571 ms of which 1 ms to minimize.
[2022-06-08 23:29:50] [INFO ] Deduced a trap composed of 189 places in 438 ms of which 1 ms to minimize.
[2022-06-08 23:29:50] [INFO ] Deduced a trap composed of 192 places in 375 ms of which 6 ms to minimize.
[2022-06-08 23:29:50] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:29:50] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:29:51] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-08 23:29:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:29:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 29 ms returned sat
[2022-06-08 23:29:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:29:52] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2022-06-08 23:29:52] [INFO ] Deduced a trap composed of 189 places in 516 ms of which 2 ms to minimize.
[2022-06-08 23:29:53] [INFO ] Deduced a trap composed of 159 places in 426 ms of which 1 ms to minimize.
[2022-06-08 23:29:53] [INFO ] Deduced a trap composed of 241 places in 606 ms of which 1 ms to minimize.
[2022-06-08 23:29:54] [INFO ] Deduced a trap composed of 159 places in 411 ms of which 1 ms to minimize.
[2022-06-08 23:29:54] [INFO ] Deduced a trap composed of 189 places in 341 ms of which 1 ms to minimize.
[2022-06-08 23:29:55] [INFO ] Deduced a trap composed of 192 places in 402 ms of which 0 ms to minimize.
[2022-06-08 23:29:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3233 ms
[2022-06-08 23:29:55] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 151 ms.
[2022-06-08 23:29:56] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:29:56] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2022-06-08 23:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:29:57] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2022-06-08 23:29:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:29:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2022-06-08 23:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:29:57] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2022-06-08 23:29:58] [INFO ] Deduced a trap composed of 159 places in 551 ms of which 1 ms to minimize.
[2022-06-08 23:29:58] [INFO ] Deduced a trap composed of 193 places in 494 ms of which 1 ms to minimize.
[2022-06-08 23:29:59] [INFO ] Deduced a trap composed of 108 places in 447 ms of which 1 ms to minimize.
[2022-06-08 23:29:59] [INFO ] Deduced a trap composed of 160 places in 462 ms of which 0 ms to minimize.
[2022-06-08 23:30:00] [INFO ] Deduced a trap composed of 107 places in 397 ms of which 1 ms to minimize.
[2022-06-08 23:30:00] [INFO ] Deduced a trap composed of 190 places in 445 ms of which 1 ms to minimize.
[2022-06-08 23:30:01] [INFO ] Deduced a trap composed of 189 places in 394 ms of which 1 ms to minimize.
[2022-06-08 23:30:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3560 ms
[2022-06-08 23:30:01] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 140 ms.
[2022-06-08 23:30:02] [INFO ] Deduced a trap composed of 20 places in 517 ms of which 1 ms to minimize.
[2022-06-08 23:30:02] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:30:02] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2022-06-08 23:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:03] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-06-08 23:30:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2022-06-08 23:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:04] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-06-08 23:30:04] [INFO ] Deduced a trap composed of 108 places in 575 ms of which 1 ms to minimize.
[2022-06-08 23:30:05] [INFO ] Deduced a trap composed of 189 places in 529 ms of which 1 ms to minimize.
[2022-06-08 23:30:05] [INFO ] Deduced a trap composed of 189 places in 412 ms of which 1 ms to minimize.
[2022-06-08 23:30:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1710 ms
[2022-06-08 23:30:05] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 116 ms.
[2022-06-08 23:30:09] [INFO ] Deduced a trap composed of 20 places in 582 ms of which 1 ms to minimize.
[2022-06-08 23:30:09] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:30:09] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2022-06-08 23:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:09] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2022-06-08 23:30:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-08 23:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:10] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2022-06-08 23:30:10] [INFO ] Deduced a trap composed of 192 places in 541 ms of which 1 ms to minimize.
[2022-06-08 23:30:11] [INFO ] Deduced a trap composed of 192 places in 533 ms of which 1 ms to minimize.
[2022-06-08 23:30:11] [INFO ] Deduced a trap composed of 192 places in 439 ms of which 1 ms to minimize.
[2022-06-08 23:30:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1706 ms
[2022-06-08 23:30:12] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 82 ms.
[2022-06-08 23:30:14] [INFO ] Added : 195 causal constraints over 39 iterations in 2698 ms. Result :sat
Minimization took 18 ms.
[2022-06-08 23:30:14] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-08 23:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:15] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2022-06-08 23:30:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-08 23:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:15] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2022-06-08 23:30:16] [INFO ] Deduced a trap composed of 195 places in 538 ms of which 1 ms to minimize.
[2022-06-08 23:30:17] [INFO ] Deduced a trap composed of 243 places in 452 ms of which 1 ms to minimize.
[2022-06-08 23:30:17] [INFO ] Deduced a trap composed of 191 places in 399 ms of which 1 ms to minimize.
[2022-06-08 23:30:17] [INFO ] Deduced a trap composed of 191 places in 333 ms of which 0 ms to minimize.
[2022-06-08 23:30:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1955 ms
[2022-06-08 23:30:17] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 88 ms.
[2022-06-08 23:30:20] [INFO ] Deduced a trap composed of 20 places in 601 ms of which 2 ms to minimize.
[2022-06-08 23:30:20] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:30:21] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2022-06-08 23:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:21] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2022-06-08 23:30:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-08 23:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:22] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2022-06-08 23:30:23] [INFO ] Deduced a trap composed of 193 places in 462 ms of which 2 ms to minimize.
[2022-06-08 23:30:23] [INFO ] Deduced a trap composed of 192 places in 393 ms of which 7 ms to minimize.
[2022-06-08 23:30:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1057 ms
[2022-06-08 23:30:23] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 121 ms.
[2022-06-08 23:30:27] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2022-06-08 23:30:27] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 699 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 697 edges and 699 vertex of which 90 / 699 are part of one of the 13 SCC in 9 ms
Free SCC test removed 77 places
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Graph (complete) has 1188 edges and 622 vertex of which 614 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 445 rules applied. Total rules applied 447 place count 614 transition count 719
Reduce places removed 441 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 463 rules applied. Total rules applied 910 place count 173 transition count 697
Reduce places removed 11 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 17 rules applied. Total rules applied 927 place count 162 transition count 691
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 935 place count 156 transition count 689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 936 place count 155 transition count 689
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 936 place count 155 transition count 678
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 958 place count 144 transition count 678
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 999 place count 103 transition count 637
Iterating global reduction 5 with 41 rules applied. Total rules applied 1040 place count 103 transition count 637
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1040 place count 103 transition count 634
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1046 place count 100 transition count 634
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1059 place count 87 transition count 200
Iterating global reduction 5 with 13 rules applied. Total rules applied 1072 place count 87 transition count 200
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1083 place count 87 transition count 189
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1115 place count 71 transition count 173
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1116 place count 71 transition count 172
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1121 place count 66 transition count 167
Iterating global reduction 7 with 5 rules applied. Total rules applied 1126 place count 66 transition count 167
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1136 place count 61 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1138 place count 61 transition count 173
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 1147 place count 61 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1149 place count 60 transition count 170
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1157 place count 60 transition count 162
Free-agglomeration rule applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1183 place count 60 transition count 136
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 1214 place count 34 transition count 131
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1218 place count 30 transition count 127
Iterating global reduction 9 with 4 rules applied. Total rules applied 1222 place count 30 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1229 place count 30 transition count 120
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1231 place count 30 transition count 120
Applied a total of 1231 rules in 267 ms. Remains 30 /699 variables (removed 669) and now considering 120/1266 (removed 1146) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/699 places, 120/1266 transitions.
// Phase 1: matrix 120 rows 30 cols
[2022-06-08 23:30:27] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 7) seen :7
FORMULA StigmergyElection-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654731029296

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="StigmergyElection-PT-05b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is StigmergyElection-PT-05b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r305-smll-165463878400115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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