fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r455-smll-167912647500542
Last Updated
May 14, 2023

About the Execution of LoLa+red for StigmergyCommit-PT-11a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7312.819 452766.00 511776.00 2944.90 FTFTFTFFTFTTTFTT normal

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-167912647500542.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 StigmergyCommit-PT-11a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647500542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 465M
-rw-r--r-- 1 mcc users 8.1K Feb 26 11:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 11:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Feb 26 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:13 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 464M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-11a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679299754185

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-11a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 08:09:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:09:36] [INFO ] Load time of PNML (sax parser for PT used): 19167 ms
[2023-03-20 08:09:37] [INFO ] Transformed 436 places.
[2023-03-20 08:09:38] [INFO ] Transformed 373236 transitions.
[2023-03-20 08:09:38] [INFO ] Found NUPN structural information;
[2023-03-20 08:09:38] [INFO ] Parsed PT model containing 436 places and 373236 transitions and 8944506 arcs in 21415 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 364478 transitions
Reduce redundant transitions removed 364478 transitions.
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13710 ms. (steps per millisecond=0 ) properties (out of 10) seen :2
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :2
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 08:09:56] [INFO ] Flow matrix only has 8722 transitions (discarded 36 similar events)
// Phase 1: matrix 8722 rows 436 cols
[2023-03-20 08:09:56] [INFO ] Computed 13 place invariants in 140 ms
[2023-03-20 08:09:57] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 08:09:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-20 08:10:02] [INFO ] After 4778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 08:10:04] [INFO ] State equation strengthened by 8357 read => feed constraints.
[2023-03-20 08:10:09] [INFO ] After 5334ms SMT Verify possible using 8357 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 08:10:17] [INFO ] Deduced a trap composed of 17 places in 7275 ms of which 14 ms to minimize.
[2023-03-20 08:10:22] [INFO ] Deduced a trap composed of 17 places in 5216 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 08:10:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:10:22] [INFO ] After 25785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 85 ms.
Support contains 88 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 8758/8758 transitions.
Graph (complete) has 1119 edges and 436 vertex of which 427 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.116 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 427 transition count 8688
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 107 place count 401 transition count 8669
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 15 rules applied. Total rules applied 122 place count 397 transition count 8658
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 136 place count 386 transition count 8655
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 136 place count 386 transition count 8594
Deduced a syphon composed of 61 places in 11 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 258 place count 325 transition count 8594
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 310 place count 273 transition count 8542
Iterating global reduction 4 with 52 rules applied. Total rules applied 362 place count 273 transition count 8542
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 367 place count 273 transition count 8537
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 395 place count 245 transition count 8506
Iterating global reduction 5 with 28 rules applied. Total rules applied 423 place count 245 transition count 8506
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 430 place count 245 transition count 8499
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 433 place count 242 transition count 8496
Iterating global reduction 6 with 3 rules applied. Total rules applied 436 place count 242 transition count 8496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 440 place count 242 transition count 8492
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 441 place count 241 transition count 8491
Iterating global reduction 7 with 1 rules applied. Total rules applied 442 place count 241 transition count 8491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 443 place count 241 transition count 8490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 461 place count 232 transition count 8481
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 462 place count 232 transition count 8480
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 468 place count 226 transition count 8474
Iterating global reduction 9 with 6 rules applied. Total rules applied 474 place count 226 transition count 8474
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 477 place count 223 transition count 8471
Iterating global reduction 9 with 3 rules applied. Total rules applied 480 place count 223 transition count 8471
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 482 place count 221 transition count 8469
Iterating global reduction 9 with 2 rules applied. Total rules applied 484 place count 221 transition count 8469
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 502 place count 221 transition count 8451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 508 place count 218 transition count 8448
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 511 place count 215 transition count 8445
Iterating global reduction 9 with 3 rules applied. Total rules applied 514 place count 215 transition count 8445
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 517 place count 215 transition count 8442
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 536 place count 215 transition count 8423
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 555 place count 196 transition count 8423
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 556 place count 196 transition count 8422
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 566 place count 196 transition count 8422
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 573 place count 196 transition count 8415
Applied a total of 573 rules in 84721 ms. Remains 196 /436 variables (removed 240) and now considering 8415/8758 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84730 ms. Remains : 196/436 places, 8415/8758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19517 ms. (steps per millisecond=0 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 2506135 steps, run timeout after 57001 ms. (steps per millisecond=43 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 2506135 steps, saw 343508 distinct states, run finished after 57005 ms. (steps per millisecond=43 ) properties seen :5
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 8415 rows 196 cols
[2023-03-20 08:13:04] [INFO ] Computed 11 place invariants in 48 ms
[2023-03-20 08:13:04] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:13:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-20 08:13:08] [INFO ] After 3044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:13:09] [INFO ] State equation strengthened by 8304 read => feed constraints.
[2023-03-20 08:13:11] [INFO ] After 2397ms SMT Verify possible using 8304 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:13:16] [INFO ] Deduced a trap composed of 7 places in 4601 ms of which 3 ms to minimize.
[2023-03-20 08:13:21] [INFO ] Deduced a trap composed of 6 places in 4140 ms of which 1 ms to minimize.
[2023-03-20 08:13:25] [INFO ] Deduced a trap composed of 8 places in 4246 ms of which 2 ms to minimize.
[2023-03-20 08:13:30] [INFO ] Deduced a trap composed of 9 places in 4614 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 08:13:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:13:30] [INFO ] After 25765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 26 ms.
Support contains 35 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 8415/8415 transitions.
Graph (complete) has 764 edges and 196 vertex of which 193 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.24 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 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 0 with 13 rules applied. Total rules applied 14 place count 193 transition count 8402
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 185 transition count 8402
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 185 transition count 8391
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 174 transition count 8391
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 157 transition count 8374
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 157 transition count 8374
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 101 place count 157 transition count 8351
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 153 transition count 8347
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 153 transition count 8347
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 142 place count 153 transition count 8314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 152 transition count 8313
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 152 transition count 8313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 152 transition count 8312
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 171 place count 139 transition count 8298
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 174 place count 139 transition count 8295
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 185 place count 128 transition count 8284
Iterating global reduction 6 with 11 rules applied. Total rules applied 196 place count 128 transition count 8284
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 201 place count 128 transition count 8279
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 203 place count 126 transition count 8277
Iterating global reduction 7 with 2 rules applied. Total rules applied 205 place count 126 transition count 8277
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 206 place count 125 transition count 8276
Iterating global reduction 7 with 1 rules applied. Total rules applied 207 place count 125 transition count 8276
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 213 place count 125 transition count 8270
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 214 place count 125 transition count 8269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 215 place count 124 transition count 8269
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 220 place count 124 transition count 8269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 221 place count 124 transition count 8268
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 225 place count 124 transition count 8264
Applied a total of 225 rules in 54770 ms. Remains 124 /196 variables (removed 72) and now considering 8264/8415 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54770 ms. Remains : 124/196 places, 8264/8415 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22773 ms. (steps per millisecond=0 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3063490 steps, run timeout after 66001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 3063490 steps, saw 384954 distinct states, run finished after 66003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8264 rows 124 cols
[2023-03-20 08:15:54] [INFO ] Computed 13 place invariants in 35 ms
[2023-03-20 08:15:54] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 08:15:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-20 08:15:57] [INFO ] After 3239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 08:15:59] [INFO ] State equation strengthened by 8213 read => feed constraints.
[2023-03-20 08:16:01] [INFO ] After 2041ms SMT Verify possible using 8213 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 08:16:07] [INFO ] Deduced a trap composed of 8 places in 5392 ms of which 1 ms to minimize.
[2023-03-20 08:16:11] [INFO ] Deduced a trap composed of 6 places in 4066 ms of which 1 ms to minimize.
[2023-03-20 08:16:16] [INFO ] Deduced a trap composed of 7 places in 4148 ms of which 1 ms to minimize.
[2023-03-20 08:16:19] [INFO ] Deduced a trap composed of 9 places in 3117 ms of which 1 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 08:16:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:16:19] [INFO ] After 25131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 17 ms.
Support contains 35 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 8264/8264 transitions.
Applied a total of 0 rules in 10745 ms. Remains 124 /124 variables (removed 0) and now considering 8264/8264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10745 ms. Remains : 124/124 places, 8264/8264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 8264/8264 transitions.
Applied a total of 0 rules in 11221 ms. Remains 124 /124 variables (removed 0) and now considering 8264/8264 (removed 0) transitions.
[2023-03-20 08:16:41] [INFO ] Invariant cache hit.
[2023-03-20 08:16:44] [INFO ] Implicit Places using invariants in 2848 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2865 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/124 places, 8264/8264 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 123 transition count 8253
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 112 transition count 8249
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 108 transition count 8249
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 30 place count 108 transition count 8242
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 101 transition count 8242
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 99 transition count 8240
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 99 transition count 8240
Performed 25 Post agglomeration using F-continuation condition with reduction of 7623 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 98 place count 74 transition count 592
Drop transitions removed 13 transitions
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 434 transitions.
Iterating post reduction 3 with 434 rules applied. Total rules applied 532 place count 74 transition count 158
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 573 place count 74 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 575 place count 73 transition count 116
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 578 place count 73 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 581 place count 70 transition count 113
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 582 place count 70 transition count 112
Applied a total of 582 rules in 735 ms. Remains 70 /123 variables (removed 53) and now considering 112/8264 (removed 8152) transitions.
// Phase 1: matrix 112 rows 70 cols
[2023-03-20 08:16:45] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-20 08:16:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 08:16:45] [INFO ] Invariant cache hit.
[2023-03-20 08:16:45] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 08:16:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/124 places, 112/8264 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15048 ms. Remains : 70/124 places, 112/8264 transitions.
[2023-03-20 08:16:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-20 08:16:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 112 transitions and 1247 arcs took 2 ms.
[2023-03-20 08:16:45] [INFO ] Flatten gal took : 57 ms
Total runtime 448410 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyCommit-PT-11a
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
ReachabilityCardinality

FORMULA StigmergyCommit-PT-11a-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679300206951

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 StigmergyCommit-PT-11a-ReachabilityCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 StigmergyCommit-PT-11a-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 StigmergyCommit-PT-11a-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 StigmergyCommit-PT-11a-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type EXCL) for StigmergyCommit-PT-11a-ReachabilityCardinality-04
lola: result : false
lola: markings : 132
lola: fired transitions : 185
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for StigmergyCommit-PT-11a-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 4 (type EQUN) for StigmergyCommit-PT-11a-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 6 (type SRCH) for StigmergyCommit-PT-11a-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyCommit-PT-11a-ReachabilityCardinality-04: EF false tandem / relaxed


Time elapsed: 0 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-11a"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-11a, examination is ReachabilityCardinality"
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-167912647500542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-11a.tgz
mv StigmergyCommit-PT-11a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;