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-167912647500518.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-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647500518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 8.4K Feb 26 11:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 11:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 11:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 11:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 11:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 11:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 126M 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-09b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679281486808

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-09b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 03:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 03:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 03:04:55] [INFO ] Load time of PNML (sax parser for PT used): 5535 ms
[2023-03-20 03:04:55] [INFO ] Transformed 3049 places.
[2023-03-20 03:04:56] [INFO ] Transformed 122340 transitions.
[2023-03-20 03:04:56] [INFO ] Found NUPN structural information;
[2023-03-20 03:04:56] [INFO ] Parsed PT model containing 3049 places and 122340 transitions and 2389246 arcs in 6539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 1627 ms. (steps per millisecond=6 ) properties (out of 13) seen :5
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 122340 rows 3049 cols
[2023-03-20 03:05:08] [INFO ] Computed 11 place invariants in 6740 ms
[2023-03-20 03:05:10] [INFO ] After 1813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:05:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 35 ms returned sat
[2023-03-20 03:05:35] [INFO ] After 23321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 03:05:35] [INFO ] After 23543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 03:05:35] [INFO ] After 25276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 125 out of 3049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3049/3049 places, 122340/122340 transitions.
Graph (trivial) has 2788 edges and 3049 vertex of which 174 / 3049 are part of one of the 27 SCC in 35 ms
Free SCC test removed 147 places
Drop transitions removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Graph (complete) has 5443 edges and 2902 vertex of which 2882 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.532 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 2033 transitions
Trivial Post-agglo rules discarded 2033 transitions
Performed 2033 trivial Post agglomeration. Transition count delta: 2033
Iterating post reduction 0 with 2043 rules applied. Total rules applied 2045 place count 2882 transition count 120099
Reduce places removed 2033 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 2078 rules applied. Total rules applied 4123 place count 849 transition count 120054
Reduce places removed 18 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 2 with 120 rules applied. Total rules applied 4243 place count 831 transition count 119952
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 103 rules applied. Total rules applied 4346 place count 729 transition count 119951
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 116 Pre rules applied. Total rules applied 4346 place count 729 transition count 119835
Deduced a syphon composed of 116 places in 183 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 4578 place count 613 transition count 119835
Discarding 89 places :
Symmetric choice reduction at 4 with 89 rule applications. Total rules 4667 place count 524 transition count 119746
Iterating global reduction 4 with 89 rules applied. Total rules applied 4756 place count 524 transition count 119746
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4758 place count 524 transition count 119744
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4758 place count 524 transition count 119742
Deduced a syphon composed of 2 places in 161 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4762 place count 522 transition count 119742
Discarding 38 places :
Symmetric choice reduction at 5 with 38 rule applications. Total rules 4800 place count 484 transition count 6084
Iterating global reduction 5 with 38 rules applied. Total rules applied 4838 place count 484 transition count 6084
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 4848 place count 484 transition count 6074
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 4853 place count 479 transition count 6069
Iterating global reduction 6 with 5 rules applied. Total rules applied 4858 place count 479 transition count 6069
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 4863 place count 474 transition count 6064
Iterating global reduction 6 with 5 rules applied. Total rules applied 4868 place count 474 transition count 6064
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4871 place count 474 transition count 6061
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4951 place count 434 transition count 6021
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 4961 place count 424 transition count 6011
Iterating global reduction 7 with 10 rules applied. Total rules applied 4971 place count 424 transition count 6011
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 4978 place count 417 transition count 6004
Iterating global reduction 7 with 7 rules applied. Total rules applied 4985 place count 417 transition count 6004
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 4991 place count 411 transition count 5998
Iterating global reduction 7 with 6 rules applied. Total rules applied 4997 place count 411 transition count 5998
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 5009 place count 405 transition count 6017
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 5013 place count 405 transition count 6013
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 5018 place count 405 transition count 6008
Free-agglomeration rule applied 83 times.
Iterating global reduction 8 with 83 rules applied. Total rules applied 5101 place count 405 transition count 5925
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 8 with 83 rules applied. Total rules applied 5184 place count 322 transition count 5925
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 2182 transitions
Redundant transition composition rules discarded 2182 transitions
Iterating global reduction 9 with 2182 rules applied. Total rules applied 7366 place count 322 transition count 3743
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 7369 place count 322 transition count 3740
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 7372 place count 319 transition count 3740
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 7380 place count 319 transition count 3740
Applied a total of 7380 rules in 58550 ms. Remains 319 /3049 variables (removed 2730) and now considering 3740/122340 (removed 118600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58555 ms. Remains : 319/3049 places, 3740/122340 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 8) seen :4
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3740 rows 319 cols
[2023-03-20 03:06:34] [INFO ] Computed 11 place invariants in 46 ms
[2023-03-20 03:06:35] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:06:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-20 03:06:37] [INFO ] After 1999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:06:38] [INFO ] State equation strengthened by 3000 read => feed constraints.
[2023-03-20 03:06:41] [INFO ] After 3194ms SMT Verify possible using 3000 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 03:06:44] [INFO ] Deduced a trap composed of 35 places in 2793 ms of which 81 ms to minimize.
[2023-03-20 03:06:47] [INFO ] Deduced a trap composed of 26 places in 2774 ms of which 1 ms to minimize.
[2023-03-20 03:06:50] [INFO ] Deduced a trap composed of 24 places in 2945 ms of which 1 ms to minimize.
[2023-03-20 03:06:53] [INFO ] Deduced a trap composed of 42 places in 3079 ms of which 2 ms to minimize.
[2023-03-20 03:06:56] [INFO ] Deduced a trap composed of 36 places in 2904 ms of which 3 ms to minimize.
[2023-03-20 03:07:00] [INFO ] Deduced a trap composed of 30 places in 3325 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 03:07:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:07:00] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 77 ms.
Support contains 72 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 3740/3740 transitions.
Graph (trivial) has 119 edges and 319 vertex of which 8 / 319 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 315 transition count 3691
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 274 transition count 3684
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 270 transition count 3683
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 95 place count 270 transition count 3676
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 109 place count 263 transition count 3676
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 115 place count 257 transition count 3670
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 257 transition count 3670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 255 transition count 3668
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 255 transition count 3668
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 134 place count 255 transition count 3659
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 162 place count 241 transition count 3644
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 166 place count 241 transition count 3640
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 184 place count 223 transition count 3622
Iterating global reduction 5 with 18 rules applied. Total rules applied 202 place count 223 transition count 3622
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 209 place count 216 transition count 3615
Iterating global reduction 5 with 7 rules applied. Total rules applied 216 place count 216 transition count 3615
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 223 place count 216 transition count 3608
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 225 place count 214 transition count 3606
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 214 transition count 3606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 228 place count 214 transition count 3605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 230 place count 213 transition count 3615
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 244 place count 213 transition count 3601
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 257 place count 213 transition count 3588
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 271 place count 200 transition count 3587
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 274 place count 200 transition count 3584
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 277 place count 200 transition count 3584
Applied a total of 277 rules in 7549 ms. Remains 200 /319 variables (removed 119) and now considering 3584/3740 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7550 ms. Remains : 200/319 places, 3584/3740 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 206781 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206781 steps, saw 35266 distinct states, run finished after 3003 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3584 rows 200 cols
[2023-03-20 03:07:11] [INFO ] Computed 11 place invariants in 25 ms
[2023-03-20 03:07:11] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 03:07:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-20 03:07:14] [INFO ] After 2413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 03:07:14] [INFO ] State equation strengthened by 3329 read => feed constraints.
[2023-03-20 03:07:19] [INFO ] After 4606ms SMT Verify possible using 3329 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 03:07:22] [INFO ] Deduced a trap composed of 25 places in 2817 ms of which 1 ms to minimize.
[2023-03-20 03:07:25] [INFO ] Deduced a trap composed of 22 places in 2318 ms of which 1 ms to minimize.
[2023-03-20 03:07:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5537 ms
[2023-03-20 03:07:28] [INFO ] Deduced a trap composed of 25 places in 2679 ms of which 1 ms to minimize.
[2023-03-20 03:07:31] [INFO ] Deduced a trap composed of 26 places in 2185 ms of which 1 ms to minimize.
[2023-03-20 03:07:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 5132 ms
[2023-03-20 03:07:31] [INFO ] After 16530ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 812 ms.
[2023-03-20 03:07:32] [INFO ] After 20096ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 66 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 3584/3584 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 0 with 4 rules applied. Total rules applied 4 place count 200 transition count 3580
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 196 transition count 3580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 196 transition count 3579
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 195 transition count 3579
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 195 transition count 3574
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 190 transition count 3573
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 190 transition count 3572
Applied a total of 22 rules in 4818 ms. Remains 190 /200 variables (removed 10) and now considering 3572/3584 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4819 ms. Remains : 190/200 places, 3572/3584 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 216621 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216621 steps, saw 37467 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3572 rows 190 cols
[2023-03-20 03:07:40] [INFO ] Computed 11 place invariants in 35 ms
[2023-03-20 03:07:40] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 03:07:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-20 03:07:42] [INFO ] After 1994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 03:07:42] [INFO ] State equation strengthened by 3328 read => feed constraints.
[2023-03-20 03:07:47] [INFO ] After 4612ms SMT Verify possible using 3328 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 03:07:51] [INFO ] Deduced a trap composed of 16 places in 3133 ms of which 1 ms to minimize.
[2023-03-20 03:07:54] [INFO ] Deduced a trap composed of 18 places in 2666 ms of which 1 ms to minimize.
[2023-03-20 03:07:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 6250 ms
[2023-03-20 03:07:54] [INFO ] After 11842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 855 ms.
[2023-03-20 03:07:55] [INFO ] After 15080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 66 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 3572/3572 transitions.
Applied a total of 0 rules in 1831 ms. Remains 190 /190 variables (removed 0) and now considering 3572/3572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1836 ms. Remains : 190/190 places, 3572/3572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 3572/3572 transitions.
Applied a total of 0 rules in 1395 ms. Remains 190 /190 variables (removed 0) and now considering 3572/3572 (removed 0) transitions.
[2023-03-20 03:07:58] [INFO ] Invariant cache hit.
[2023-03-20 03:07:59] [INFO ] Implicit Places using invariants in 1024 ms returned [189]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1042 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/190 places, 3572/3572 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 189 transition count 3556
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 20 rules applied. Total rules applied 36 place count 173 transition count 3552
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 169 transition count 3552
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 169 transition count 3546
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 163 transition count 3546
Performed 23 Post agglomeration using F-continuation condition with reduction of 1071 identical transitions.
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 98 place count 140 transition count 2452
Ensure Unique test removed 1202 transitions
Reduce isomorphic transitions removed 1202 transitions.
Iterating post reduction 3 with 1202 rules applied. Total rules applied 1300 place count 140 transition count 1250
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1302 place count 138 transition count 706
Iterating global reduction 4 with 2 rules applied. Total rules applied 1304 place count 138 transition count 706
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1312 place count 134 transition count 702
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1316 place count 132 transition count 707
Drop transitions removed 148 transitions
Redundant transition composition rules discarded 148 transitions
Iterating global reduction 4 with 148 rules applied. Total rules applied 1464 place count 132 transition count 559
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1471 place count 132 transition count 552
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1478 place count 125 transition count 552
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1480 place count 125 transition count 550
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1482 place count 125 transition count 550
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1484 place count 125 transition count 548
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1486 place count 123 transition count 546
Iterating global reduction 5 with 2 rules applied. Total rules applied 1488 place count 123 transition count 546
Applied a total of 1488 rules in 675 ms. Remains 123 /189 variables (removed 66) and now considering 546/3572 (removed 3026) transitions.
// Phase 1: matrix 546 rows 123 cols
[2023-03-20 03:08:00] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-20 03:08:00] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-20 03:08:00] [INFO ] Invariant cache hit.
[2023-03-20 03:08:01] [INFO ] State equation strengthened by 408 read => feed constraints.
[2023-03-20 03:08:01] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 123/190 places, 546/3572 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4132 ms. Remains : 123/190 places, 546/3572 transitions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 738400 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 738400 steps, saw 106744 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 03:08:05] [INFO ] Invariant cache hit.
[2023-03-20 03:08:05] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 03:08:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-20 03:08:05] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 03:08:05] [INFO ] State equation strengthened by 408 read => feed constraints.
[2023-03-20 03:08:06] [INFO ] After 516ms SMT Verify possible using 408 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 03:08:06] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2023-03-20 03:08:06] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 1 ms to minimize.
[2023-03-20 03:08:07] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2023-03-20 03:08:07] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-20 03:08:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1274 ms
[2023-03-20 03:08:07] [INFO ] After 2015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-20 03:08:07] [INFO ] After 2639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 546/546 transitions.
Applied a total of 0 rules in 66 ms. Remains 123 /123 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 123/123 places, 546/546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 546/546 transitions.
Applied a total of 0 rules in 65 ms. Remains 123 /123 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2023-03-20 03:08:08] [INFO ] Invariant cache hit.
[2023-03-20 03:08:08] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-20 03:08:08] [INFO ] Invariant cache hit.
[2023-03-20 03:08:08] [INFO ] State equation strengthened by 408 read => feed constraints.
[2023-03-20 03:08:09] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-20 03:08:09] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-20 03:08:09] [INFO ] Invariant cache hit.
[2023-03-20 03:08:10] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2163 ms. Remains : 123/123 places, 546/546 transitions.
Applied a total of 0 rules in 25 ms. Remains 123 /123 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-20 03:08:10] [INFO ] Invariant cache hit.
[2023-03-20 03:08:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 03:08:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-20 03:08:10] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 03:08:11] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2023-03-20 03:08:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-20 03:08:11] [INFO ] After 951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-20 03:08:11] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 03:08:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-20 03:08:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 546 transitions and 8526 arcs took 16 ms.
[2023-03-20 03:08:12] [INFO ] Flatten gal took : 314 ms
Total runtime 202325 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyCommit-PT-09b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityCardinality

FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA StigmergyCommit-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679281694460

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type EXCL) for 3 StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 3 StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 3 StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 13 (type SRCH) for 3 StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 14 (type EXCL) for StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 10 (type FNDP) for StigmergyCommit-PT-09b-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 11 (type EQUN) for StigmergyCommit-PT-09b-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 13 (type SRCH) for StigmergyCommit-PT-09b-ReachabilityCardinality-01 (obsolete)
lola: FINISHED task # 10 (type FNDP) for StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 20 (type EXCL) for 6 StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 6 StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 6 StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 6 StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 20 (type EXCL) for StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: result : true
lola: markings : 3
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for StigmergyCommit-PT-09b-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 17 (type EQUN) for StigmergyCommit-PT-09b-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 19 (type SRCH) for StigmergyCommit-PT-09b-ReachabilityCardinality-08 (obsolete)
lola: FINISHED task # 16 (type FNDP) for StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/376/ReachabilityCardinality-17.sara.
sara: try reading problem file /home/mcc/execution/376/ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: FINISHED task # 11 (type EQUN) for StigmergyCommit-PT-09b-ReachabilityCardinality-01
lola: result : true
lola: FINISHED task # 17 (type EQUN) for StigmergyCommit-PT-09b-ReachabilityCardinality-08
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 27 (type EXCL) for 0 StigmergyCommit-PT-09b-ReachabilityCardinality-00
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 23 (type FNDP) for 0 StigmergyCommit-PT-09b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 0 StigmergyCommit-PT-09b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 26 (type SRCH) for 0 StigmergyCommit-PT-09b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 26 (type SRCH) for StigmergyCommit-PT-09b-ReachabilityCardinality-00
lola: result : true
lola: markings : 13
lola: fired transitions : 12
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 23 (type FNDP) for StigmergyCommit-PT-09b-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 24 (type EQUN) for StigmergyCommit-PT-09b-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 27 (type EXCL) for StigmergyCommit-PT-09b-ReachabilityCardinality-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyCommit-PT-09b-ReachabilityCardinality-00: AG false tandem / insertion
StigmergyCommit-PT-09b-ReachabilityCardinality-01: AG false tandem / relaxed
StigmergyCommit-PT-09b-ReachabilityCardinality-08: EF true tandem / relaxed


Time elapsed: 1 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-09b"
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-09b, 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-167912647500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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