fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872700293
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyElection-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
268.764 41803.00 60101.00 348.10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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-165463872700293.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 StigmergyElection-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872700293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.3K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 30 14:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 9.2K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 203K 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-04b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654845506437

Running Version 202205111006
[2022-06-10 07:18: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-10 07:18:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 07:18:29] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2022-06-10 07:18:29] [INFO ] Transformed 563 places.
[2022-06-10 07:18:29] [INFO ] Transformed 780 transitions.
[2022-06-10 07:18:29] [INFO ] Found NUPN structural information;
[2022-06-10 07:18:29] [INFO ] Parsed PT model containing 563 places and 780 transitions in 527 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 780 rows 563 cols
[2022-06-10 07:18:29] [INFO ] Computed 5 place invariants in 42 ms
Incomplete random walk after 10000 steps, including 135 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :10
FORMULA StigmergyElection-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
// Phase 1: matrix 780 rows 563 cols
[2022-06-10 07:18:29] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-10 07:18:30] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2022-06-10 07:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:30] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-06-10 07:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 07:18:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2022-06-10 07:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:31] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-06-10 07:18:31] [INFO ] Deduced a trap composed of 189 places in 387 ms of which 6 ms to minimize.
[2022-06-10 07:18:32] [INFO ] Deduced a trap composed of 189 places in 308 ms of which 2 ms to minimize.
[2022-06-10 07:18:32] [INFO ] Deduced a trap composed of 189 places in 247 ms of which 3 ms to minimize.
[2022-06-10 07:18:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1117 ms
[2022-06-10 07:18:32] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 97 ms.
[2022-06-10 07:18:35] [INFO ] Added : 230 causal constraints over 46 iterations in 3242 ms. Result :unknown
[2022-06-10 07:18:35] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2022-06-10 07:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:36] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-06-10 07:18:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 07:18:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2022-06-10 07:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:36] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2022-06-10 07:18:37] [INFO ] Deduced a trap composed of 191 places in 391 ms of which 2 ms to minimize.
[2022-06-10 07:18:37] [INFO ] Deduced a trap composed of 190 places in 474 ms of which 1 ms to minimize.
[2022-06-10 07:18:38] [INFO ] Deduced a trap composed of 191 places in 340 ms of which 2 ms to minimize.
[2022-06-10 07:18:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1374 ms
[2022-06-10 07:18:38] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 97 ms.
[2022-06-10 07:18:41] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2022-06-10 07:18:41] [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-10 07:18:42] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2022-06-10 07:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:42] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2022-06-10 07:18:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 07:18:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2022-06-10 07:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:42] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-10 07:18:43] [INFO ] Deduced a trap composed of 203 places in 407 ms of which 1 ms to minimize.
[2022-06-10 07:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2022-06-10 07:18:43] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 78 ms.
[2022-06-10 07:18:47] [INFO ] Added : 306 causal constraints over 62 iterations in 4075 ms. Result :unknown
[2022-06-10 07:18:47] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2022-06-10 07:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:48] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-06-10 07:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 07:18:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2022-06-10 07:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:48] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2022-06-10 07:18:49] [INFO ] Deduced a trap composed of 195 places in 433 ms of which 2 ms to minimize.
[2022-06-10 07:18:49] [INFO ] Deduced a trap composed of 190 places in 299 ms of which 1 ms to minimize.
[2022-06-10 07:18:50] [INFO ] Deduced a trap composed of 189 places in 382 ms of which 1 ms to minimize.
[2022-06-10 07:18:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1322 ms
[2022-06-10 07:18:50] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 68 ms.
[2022-06-10 07:18:53] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2022-06-10 07:18:53] [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-10 07:18:53] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2022-06-10 07:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:54] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-06-10 07:18:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 07:18:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2022-06-10 07:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:54] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2022-06-10 07:18:55] [INFO ] Deduced a trap composed of 195 places in 467 ms of which 1 ms to minimize.
[2022-06-10 07:18:55] [INFO ] Deduced a trap composed of 193 places in 269 ms of which 1 ms to minimize.
[2022-06-10 07:18:55] [INFO ] Deduced a trap composed of 191 places in 217 ms of which 1 ms to minimize.
[2022-06-10 07:18:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1150 ms
[2022-06-10 07:18:56] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 86 ms.
[2022-06-10 07:18:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-10 07:18:59] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2022-06-10 07:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-10 07:18:59] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-06-10 07:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-10 07:18:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2022-06-10 07:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-10 07:19:00] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2022-06-10 07:19:00] [INFO ] Deduced a trap composed of 246 places in 503 ms of which 2 ms to minimize.
[2022-06-10 07:19:01] [INFO ] Deduced a trap composed of 191 places in 384 ms of which 1 ms to minimize.
[2022-06-10 07:19:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1042 ms
[2022-06-10 07:19:01] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 71 ms.
[2022-06-10 07:19:05] [INFO ] Deduced a trap composed of 20 places in 606 ms of which 2 ms to minimize.
[2022-06-10 07:19:05] [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.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] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA StigmergyElection-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 568 edges and 563 vertex of which 84 / 563 are part of one of the 12 SCC in 12 ms
Free SCC test removed 72 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 853 edges and 491 vertex of which 483 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 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 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 357 rules applied. Total rules applied 359 place count 483 transition count 327
Reduce places removed 353 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 377 rules applied. Total rules applied 736 place count 130 transition count 303
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 751 place count 118 transition count 300
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 754 place count 115 transition count 300
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 754 place count 115 transition count 290
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 774 place count 105 transition count 290
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 805 place count 74 transition count 259
Iterating global reduction 4 with 31 rules applied. Total rules applied 836 place count 74 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 836 place count 74 transition count 258
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 838 place count 73 transition count 258
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 849 place count 62 transition count 136
Iterating global reduction 4 with 11 rules applied. Total rules applied 860 place count 62 transition count 136
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 867 place count 62 transition count 129
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 891 place count 50 transition count 117
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 892 place count 50 transition count 116
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 894 place count 48 transition count 114
Iterating global reduction 6 with 2 rules applied. Total rules applied 896 place count 48 transition count 114
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 902 place count 45 transition count 122
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 910 place count 45 transition count 114
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 933 place count 45 transition count 91
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 973 place count 22 transition count 74
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 977 place count 18 transition count 70
Iterating global reduction 7 with 4 rules applied. Total rules applied 981 place count 18 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 984 place count 18 transition count 67
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 1005 place count 18 transition count 46
Applied a total of 1005 rules in 203 ms. Remains 18 /563 variables (removed 545) and now considering 46/780 (removed 734) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/563 places, 46/780 transitions.
// Phase 1: matrix 46 rows 18 cols
[2022-06-10 07:19:06] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties (out of 4) seen :4
FORMULA StigmergyElection-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 39652 ms.

BK_STOP 1654845548240

--------------------
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="StigmergyElection-PT-04b"
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 StigmergyElection-PT-04b, 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-165463872700293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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