Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 117K Mar 5 18:23 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-03b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679312843129

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 11:47:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 11:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:47:26] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2023-03-20 11:47:26] [INFO ] Transformed 427 places.
[2023-03-20 11:47:26] [INFO ] Transformed 518 transitions.
[2023-03-20 11:47:26] [INFO ] Found NUPN structural information;
[2023-03-20 11:47:26] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 518 rows 427 cols
[2023-03-20 11:47:26] [INFO ] Computed 4 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 173 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :5
FORMULA StigmergyElection-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :2
FORMULA StigmergyElection-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :1
FORMULA StigmergyElection-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :1
FORMULA StigmergyElection-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-20 11:47:27] [INFO ] Invariant cache hit.
[2023-03-20 11:47:27] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2023-03-20 11:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:28] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-20 11:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:47:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-20 11:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:28] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-20 11:47:29] [INFO ] Deduced a trap composed of 194 places in 298 ms of which 12 ms to minimize.
[2023-03-20 11:47:29] [INFO ] Deduced a trap composed of 191 places in 248 ms of which 1 ms to minimize.
[2023-03-20 11:47:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 673 ms
[2023-03-20 11:47:29] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 54 ms.
[2023-03-20 11:47:33] [INFO ] Deduced a trap composed of 190 places in 287 ms of which 2 ms to minimize.
[2023-03-20 11:47:33] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-20 11:47:33] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-20 11:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:33] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-20 11:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:47:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2023-03-20 11:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:34] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2023-03-20 11:47:34] [INFO ] Deduced a trap composed of 189 places in 413 ms of which 2 ms to minimize.
[2023-03-20 11:47:34] [INFO ] Deduced a trap composed of 189 places in 301 ms of which 2 ms to minimize.
[2023-03-20 11:47:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 826 ms
[2023-03-20 11:47:34] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 65 ms.
[2023-03-20 11:47:38] [INFO ] Deduced a trap composed of 190 places in 306 ms of which 1 ms to minimize.
[2023-03-20 11:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-20 11:47:38] [INFO ] Added : 285 causal constraints over 57 iterations in 3726 ms. Result :sat
Minimization took 16 ms.
[2023-03-20 11:47:38] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-20 11:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:39] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-20 11:47:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:47:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-20 11:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:39] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2023-03-20 11:47:39] [INFO ] Deduced a trap composed of 194 places in 280 ms of which 1 ms to minimize.
[2023-03-20 11:47:40] [INFO ] Deduced a trap composed of 190 places in 184 ms of which 1 ms to minimize.
[2023-03-20 11:47:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 563 ms
[2023-03-20 11:47:40] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 50 ms.
[2023-03-20 11:47:43] [INFO ] Deduced a trap composed of 190 places in 236 ms of which 1 ms to minimize.
[2023-03-20 11:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-20 11:47:43] [INFO ] Added : 291 causal constraints over 59 iterations in 3532 ms. Result :sat
Minimization took 153 ms.
[2023-03-20 11:47:44] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-20 11:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:44] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-20 11:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:47:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-20 11:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:44] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2023-03-20 11:47:45] [INFO ] Deduced a trap composed of 190 places in 314 ms of which 2 ms to minimize.
[2023-03-20 11:47:45] [INFO ] Deduced a trap composed of 190 places in 222 ms of which 1 ms to minimize.
[2023-03-20 11:47:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 638 ms
[2023-03-20 11:47:45] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 58 ms.
[2023-03-20 11:47:49] [INFO ] Added : 318 causal constraints over 64 iterations in 3757 ms. Result :sat
Minimization took 128 ms.
[2023-03-20 11:47:49] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-20 11:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:49] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-20 11:47:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:47:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-20 11:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:50] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-20 11:47:50] [INFO ] Deduced a trap composed of 241 places in 297 ms of which 1 ms to minimize.
[2023-03-20 11:47:50] [INFO ] Deduced a trap composed of 189 places in 232 ms of which 1 ms to minimize.
[2023-03-20 11:47:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2023-03-20 11:47:50] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 58 ms.
[2023-03-20 11:47:54] [INFO ] Added : 340 causal constraints over 68 iterations in 3914 ms. Result :unknown
[2023-03-20 11:47:54] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2023-03-20 11:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:55] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-20 11:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:47:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-20 11:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:47:55] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2023-03-20 11:47:56] [INFO ] Deduced a trap composed of 190 places in 341 ms of which 1 ms to minimize.
[2023-03-20 11:47:56] [INFO ] Deduced a trap composed of 189 places in 338 ms of which 1 ms to minimize.
[2023-03-20 11:47:56] [INFO ] Deduced a trap composed of 189 places in 265 ms of which 1 ms to minimize.
[2023-03-20 11:47:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1073 ms
[2023-03-20 11:47:56] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 53 ms.
[2023-03-20 11:48:00] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 2 ms to minimize.
[2023-03-20 11:48:00] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2023-03-20 11:48:00] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2023-03-20 11:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:48:01] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2023-03-20 11:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:48:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2023-03-20 11:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:48:01] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-20 11:48:02] [INFO ] Deduced a trap composed of 189 places in 286 ms of which 1 ms to minimize.
[2023-03-20 11:48:02] [INFO ] Deduced a trap composed of 189 places in 244 ms of which 1 ms to minimize.
[2023-03-20 11:48:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 644 ms
[2023-03-20 11:48:02] [INFO ] Computed and/alt/rep : 477/791/477 causal constraints (skipped 40 transitions) in 57 ms.
[2023-03-20 11:48:06] [INFO ] Deduced a trap composed of 189 places in 319 ms of which 1 ms to minimize.
[2023-03-20 11:48:06] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyElection-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 518/518 transitions.
Graph (trivial) has 423 edges and 427 vertex of which 51 / 427 are part of one of the 7 SCC in 8 ms
Free SCC test removed 44 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 592 edges and 383 vertex of which 379 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.13 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 270 rules applied. Total rules applied 272 place count 379 transition count 190
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 284 rules applied. Total rules applied 556 place count 111 transition count 174
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 568 place count 103 transition count 170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 572 place count 99 transition count 170
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 572 place count 99 transition count 164
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 584 place count 93 transition count 164
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 610 place count 67 transition count 138
Iterating global reduction 4 with 26 rules applied. Total rules applied 636 place count 67 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 638 place count 67 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 639 place count 66 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 639 place count 66 transition count 133
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 645 place count 63 transition count 133
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 654 place count 54 transition count 87
Iterating global reduction 6 with 9 rules applied. Total rules applied 663 place count 54 transition count 87
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 670 place count 54 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 686 place count 46 transition count 72
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 687 place count 46 transition count 71
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 689 place count 44 transition count 69
Iterating global reduction 8 with 2 rules applied. Total rules applied 691 place count 44 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 699 place count 40 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 700 place count 40 transition count 72
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 704 place count 40 transition count 68
Free-agglomeration rule applied 16 times.
Iterating global reduction 9 with 16 rules applied. Total rules applied 720 place count 40 transition count 52
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 741 place count 24 transition count 47
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 744 place count 21 transition count 44
Iterating global reduction 10 with 3 rules applied. Total rules applied 747 place count 21 transition count 44
Applied a total of 747 rules in 170 ms. Remains 21 /427 variables (removed 406) and now considering 44/518 (removed 474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 21/427 places, 44/518 transitions.
// Phase 1: matrix 44 rows 21 cols
[2023-03-20 11:48:06] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 6) seen :6
FORMULA StigmergyElection-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 41340 ms.
ITS solved all properties within timeout

BK_STOP 1679312888679

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is StigmergyElection-PT-03b, 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 r455-smll-167912647600581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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