About the Execution of LoLa+red for StigmergyCommit-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 700.571 | 69747.00 | 107059.00 | 584.80 | TFTFFTFTTFTFFFFF | 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-167912647400470.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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647400470
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 10:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3.7M 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-06b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679253936411
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-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 19:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:25:39] [INFO ] Load time of PNML (sax parser for PT used): 605 ms
[2023-03-19 19:25:40] [INFO ] Transformed 2140 places.
[2023-03-19 19:25:40] [INFO ] Transformed 6760 transitions.
[2023-03-19 19:25:40] [INFO ] Found NUPN structural information;
[2023-03-19 19:25:40] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 883 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-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 75 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 15) seen :2
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 6760 rows 2140 cols
[2023-03-19 19:25:42] [INFO ] Computed 8 place invariants in 191 ms
[2023-03-19 19:25:44] [INFO ] After 1639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 19:25:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2023-03-19 19:25:52] [INFO ] After 6842ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :7
[2023-03-19 19:25:58] [INFO ] Deduced a trap composed of 401 places in 4726 ms of which 20 ms to minimize.
[2023-03-19 19:26:02] [INFO ] Deduced a trap composed of 400 places in 4413 ms of which 3 ms to minimize.
[2023-03-19 19:26:07] [INFO ] Deduced a trap composed of 402 places in 4224 ms of which 3 ms to minimize.
[2023-03-19 19:26:10] [INFO ] Deduced a trap composed of 401 places in 3278 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-19 19:26:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 19:26:10] [INFO ] After 26241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 245 ms.
Support contains 100 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 1946 edges and 2140 vertex of which 127 / 2140 are part of one of the 19 SCC in 19 ms
Free SCC test removed 108 places
Drop transitions removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 3348 edges and 2032 vertex of which 2018 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.46 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1419 transitions
Trivial Post-agglo rules discarded 1419 transitions
Performed 1419 trivial Post agglomeration. Transition count delta: 1419
Iterating post reduction 0 with 1426 rules applied. Total rules applied 1428 place count 2018 transition count 5189
Reduce places removed 1419 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 1452 rules applied. Total rules applied 2880 place count 599 transition count 5156
Reduce places removed 13 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 2 with 80 rules applied. Total rules applied 2960 place count 586 transition count 5089
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 69 rules applied. Total rules applied 3029 place count 519 transition count 5087
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3030 place count 518 transition count 5087
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 79 Pre rules applied. Total rules applied 3030 place count 518 transition count 5008
Deduced a syphon composed of 79 places in 4 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 3188 place count 439 transition count 5008
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 3250 place count 377 transition count 4946
Iterating global reduction 5 with 62 rules applied. Total rules applied 3312 place count 377 transition count 4946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3312 place count 377 transition count 4945
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3314 place count 376 transition count 4945
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 3339 place count 351 transition count 1104
Iterating global reduction 5 with 25 rules applied. Total rules applied 3364 place count 351 transition count 1104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3372 place count 351 transition count 1096
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3376 place count 347 transition count 1092
Iterating global reduction 6 with 4 rules applied. Total rules applied 3380 place count 347 transition count 1092
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3384 place count 343 transition count 1088
Iterating global reduction 6 with 4 rules applied. Total rules applied 3388 place count 343 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3390 place count 343 transition count 1086
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 3446 place count 315 transition count 1058
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3452 place count 309 transition count 1052
Iterating global reduction 7 with 6 rules applied. Total rules applied 3458 place count 309 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3462 place count 305 transition count 1048
Iterating global reduction 7 with 4 rules applied. Total rules applied 3466 place count 305 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3469 place count 302 transition count 1045
Iterating global reduction 7 with 3 rules applied. Total rules applied 3472 place count 302 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3474 place count 301 transition count 1048
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 3481 place count 301 transition count 1041
Free-agglomeration rule applied 59 times.
Iterating global reduction 7 with 59 rules applied. Total rules applied 3540 place count 301 transition count 982
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 7 with 59 rules applied. Total rules applied 3599 place count 242 transition count 982
Drop transitions removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 8 with 119 rules applied. Total rules applied 3718 place count 242 transition count 863
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3722 place count 242 transition count 863
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3725 place count 242 transition count 860
Applied a total of 3725 rules in 1421 ms. Remains 242 /2140 variables (removed 1898) and now considering 860/6760 (removed 5900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1422 ms. Remains : 242/2140 places, 860/6760 transitions.
Incomplete random walk after 10000 steps, including 416 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 7) seen :2
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 860 rows 242 cols
[2023-03-19 19:26:13] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-19 19:26:13] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 19:26:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-19 19:26:13] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 19:26:13] [INFO ] State equation strengthened by 491 read => feed constraints.
[2023-03-19 19:26:14] [INFO ] After 467ms SMT Verify possible using 491 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 19:26:14] [INFO ] Deduced a trap composed of 33 places in 351 ms of which 1 ms to minimize.
[2023-03-19 19:26:15] [INFO ] Deduced a trap composed of 34 places in 418 ms of which 1 ms to minimize.
[2023-03-19 19:26:15] [INFO ] Deduced a trap composed of 35 places in 464 ms of which 1 ms to minimize.
[2023-03-19 19:26:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1340 ms
[2023-03-19 19:26:16] [INFO ] Deduced a trap composed of 53 places in 367 ms of which 2 ms to minimize.
[2023-03-19 19:26:16] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 0 ms to minimize.
[2023-03-19 19:26:16] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 1 ms to minimize.
[2023-03-19 19:26:17] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2023-03-19 19:26:17] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 0 ms to minimize.
[2023-03-19 19:26:17] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 0 ms to minimize.
[2023-03-19 19:26:18] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 1 ms to minimize.
[2023-03-19 19:26:18] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 1 ms to minimize.
[2023-03-19 19:26:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2665 ms
[2023-03-19 19:26:18] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 0 ms to minimize.
[2023-03-19 19:26:19] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 0 ms to minimize.
[2023-03-19 19:26:19] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 0 ms to minimize.
[2023-03-19 19:26:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 962 ms
[2023-03-19 19:26:19] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 0 ms to minimize.
[2023-03-19 19:26:20] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 1 ms to minimize.
[2023-03-19 19:26:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 575 ms
[2023-03-19 19:26:20] [INFO ] Deduced a trap composed of 43 places in 394 ms of which 1 ms to minimize.
[2023-03-19 19:26:20] [INFO ] Deduced a trap composed of 43 places in 363 ms of which 1 ms to minimize.
[2023-03-19 19:26:21] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2023-03-19 19:26:21] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 1 ms to minimize.
[2023-03-19 19:26:21] [INFO ] Deduced a trap composed of 53 places in 326 ms of which 0 ms to minimize.
[2023-03-19 19:26:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1740 ms
[2023-03-19 19:26:21] [INFO ] After 8032ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-19 19:26:22] [INFO ] After 8921ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 64 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 860/860 transitions.
Graph (trivial) has 68 edges and 242 vertex of which 4 / 242 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 240 transition count 828
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 212 transition count 826
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 210 transition count 826
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 61 place count 210 transition count 822
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 69 place count 206 transition count 822
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 74 place count 201 transition count 817
Iterating global reduction 3 with 5 rules applied. Total rules applied 79 place count 201 transition count 817
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 200 transition count 816
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 200 transition count 816
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 95 place count 193 transition count 809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 193 transition count 808
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 100 place count 189 transition count 804
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 189 transition count 804
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 188 transition count 803
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 188 transition count 803
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 187 transition count 802
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 187 transition count 802
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 125 place count 187 transition count 785
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 135 place count 187 transition count 775
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 145 place count 177 transition count 775
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 151 place count 171 transition count 769
Iterating global reduction 5 with 6 rules applied. Total rules applied 157 place count 171 transition count 769
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 171 transition count 769
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 171 transition count 768
Applied a total of 160 rules in 493 ms. Remains 171 /242 variables (removed 71) and now considering 768/860 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 171/242 places, 768/860 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 4) seen :1
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 768 rows 171 cols
[2023-03-19 19:26:23] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-19 19:26:23] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 19:26:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-19 19:26:23] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:23] [INFO ] State equation strengthened by 593 read => feed constraints.
[2023-03-19 19:26:24] [INFO ] After 551ms SMT Verify possible using 593 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:24] [INFO ] Deduced a trap composed of 28 places in 336 ms of which 1 ms to minimize.
[2023-03-19 19:26:25] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2023-03-19 19:26:25] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-19 19:26:25] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2023-03-19 19:26:25] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 1 ms to minimize.
[2023-03-19 19:26:26] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2023-03-19 19:26:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1928 ms
[2023-03-19 19:26:26] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 1 ms to minimize.
[2023-03-19 19:26:26] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 8 ms to minimize.
[2023-03-19 19:26:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 551 ms
[2023-03-19 19:26:27] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 1 ms to minimize.
[2023-03-19 19:26:27] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 0 ms to minimize.
[2023-03-19 19:26:28] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 1 ms to minimize.
[2023-03-19 19:26:28] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2023-03-19 19:26:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1448 ms
[2023-03-19 19:26:28] [INFO ] After 4885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-19 19:26:28] [INFO ] After 5752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 48 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 768/768 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 171 transition count 755
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 158 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 157 transition count 754
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 28 place count 157 transition count 751
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 34 place count 154 transition count 751
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 151 transition count 748
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 151 transition count 748
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 150 transition count 747
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 150 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 150 transition count 746
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 53 place count 145 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 145 transition count 740
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 60 place count 139 transition count 734
Iterating global reduction 5 with 6 rules applied. Total rules applied 66 place count 139 transition count 734
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 70 place count 135 transition count 730
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 135 transition count 730
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 134 transition count 729
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 134 transition count 729
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 133 transition count 732
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 82 place count 133 transition count 728
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 133 transition count 726
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 87 place count 131 transition count 725
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 89 place count 131 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 131 transition count 724
Applied a total of 90 rules in 265 ms. Remains 131 /171 variables (removed 40) and now considering 724/768 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 131/171 places, 724/768 transitions.
Incomplete random walk after 10000 steps, including 242 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 736737 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 736737 steps, saw 120494 distinct states, run finished after 3005 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 724 rows 131 cols
[2023-03-19 19:26:32] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-19 19:26:32] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 19:26:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-19 19:26:32] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:32] [INFO ] State equation strengthened by 576 read => feed constraints.
[2023-03-19 19:26:33] [INFO ] After 278ms SMT Verify possible using 576 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:33] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 0 ms to minimize.
[2023-03-19 19:26:33] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 1 ms to minimize.
[2023-03-19 19:26:34] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 0 ms to minimize.
[2023-03-19 19:26:34] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 1 ms to minimize.
[2023-03-19 19:26:34] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 1 ms to minimize.
[2023-03-19 19:26:35] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2023-03-19 19:26:35] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 1 ms to minimize.
[2023-03-19 19:26:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2313 ms
[2023-03-19 19:26:35] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 0 ms to minimize.
[2023-03-19 19:26:35] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 0 ms to minimize.
[2023-03-19 19:26:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 459 ms
[2023-03-19 19:26:36] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2023-03-19 19:26:36] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-19 19:26:36] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 0 ms to minimize.
[2023-03-19 19:26:37] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2023-03-19 19:26:37] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 0 ms to minimize.
[2023-03-19 19:26:37] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 0 ms to minimize.
[2023-03-19 19:26:37] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2023-03-19 19:26:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1885 ms
[2023-03-19 19:26:37] [INFO ] After 5077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-19 19:26:38] [INFO ] After 5644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 48 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 724/724 transitions.
Applied a total of 0 rules in 45 ms. Remains 131 /131 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 131/131 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 724/724 transitions.
Applied a total of 0 rules in 47 ms. Remains 131 /131 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-19 19:26:38] [INFO ] Invariant cache hit.
[2023-03-19 19:26:38] [INFO ] Implicit Places using invariants in 151 ms returned [130]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/131 places, 724/724 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 130 transition count 719
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 125 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 122 transition count 716
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 16 place count 122 transition count 711
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 117 transition count 711
Performed 20 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 66 place count 97 transition count 599
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 83 place count 97 transition count 582
Renaming transitions due to excessive name length > 1024 char.
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 95 transition count 294
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 95 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 94 transition count 295
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 112 place count 94 transition count 272
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 94 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 92 transition count 270
Applied a total of 116 rules in 97 ms. Remains 92 /130 variables (removed 38) and now considering 270/724 (removed 454) transitions.
// Phase 1: matrix 270 rows 92 cols
[2023-03-19 19:26:38] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-19 19:26:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 19:26:38] [INFO ] Invariant cache hit.
[2023-03-19 19:26:38] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-19 19:26:38] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 92/131 places, 270/724 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 582 ms. Remains : 92/131 places, 270/724 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1261031 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :{}
Probabilistic random walk after 1261031 steps, saw 180561 distinct states, run finished after 3001 ms. (steps per millisecond=420 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 19:26:42] [INFO ] Invariant cache hit.
[2023-03-19 19:26:42] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 19:26:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-19 19:26:42] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:42] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-19 19:26:42] [INFO ] After 105ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:42] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-19 19:26:42] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-19 19:26:42] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2023-03-19 19:26:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-19 19:26:42] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-19 19:26:42] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-19 19:26:43] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-19 19:26:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 689 ms
[2023-03-19 19:26:43] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-03-19 19:26:43] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-19 19:26:43] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-19 19:26:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-19 19:26:43] [INFO ] After 1182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-19 19:26:43] [INFO ] After 1444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 48 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 92 /92 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 92/92 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 270/270 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-19 19:26:43] [INFO ] Invariant cache hit.
[2023-03-19 19:26:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 19:26:43] [INFO ] Invariant cache hit.
[2023-03-19 19:26:43] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-19 19:26:43] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-19 19:26:43] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 19:26:43] [INFO ] Invariant cache hit.
[2023-03-19 19:26:44] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 92/92 places, 270/270 transitions.
Graph (trivial) has 7 edges and 92 vertex of which 2 / 92 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 5 ms. Remains 91 /92 variables (removed 1) and now considering 268/270 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 268 rows 91 cols
[2023-03-19 19:26:44] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-19 19:26:44] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 19:26:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-19 19:26:44] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 19:26:44] [INFO ] After 58ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:44] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-19 19:26:44] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-19 19:26:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-19 19:26:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 270 transitions and 2542 arcs took 4 ms.
[2023-03-19 19:26:44] [INFO ] Flatten gal took : 89 ms
Total runtime 65661 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT StigmergyCommit-PT-06b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679254006158
--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/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-06b-ReachabilityCardinality-13
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 3 StigmergyCommit-PT-06b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 3 StigmergyCommit-PT-06b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type SRCH) for 3 StigmergyCommit-PT-06b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: FINISHED task # 14 (type EXCL) for StigmergyCommit-PT-06b-ReachabilityCardinality-13
lola: result : true
lola: markings : 41
lola: fired transitions : 88
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 10 (type FNDP) for StigmergyCommit-PT-06b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 11 (type EQUN) for StigmergyCommit-PT-06b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 13 (type SRCH) for StigmergyCommit-PT-06b-ReachabilityCardinality-13 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 0 StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 0 StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 0 StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 0 StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type SRCH) for StigmergyCommit-PT-06b-ReachabilityCardinality-13
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type FNDP) for StigmergyCommit-PT-06b-ReachabilityCardinality-13
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 19 (type SRCH) for StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for StigmergyCommit-PT-06b-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 17 (type EQUN) for StigmergyCommit-PT-06b-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 20 (type EXCL) for StigmergyCommit-PT-06b-ReachabilityCardinality-10 (obsolete)
lola: FINISHED task # 17 (type EQUN) for StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: result : unknown
lola: FINISHED task # 16 (type FNDP) for StigmergyCommit-PT-06b-ReachabilityCardinality-10
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 6 StigmergyCommit-PT-06b-ReachabilityCardinality-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 23 (type FNDP) for 6 StigmergyCommit-PT-06b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 6 StigmergyCommit-PT-06b-ReachabilityCardinality-15
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 6 StigmergyCommit-PT-06b-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 23 (type FNDP) for StigmergyCommit-PT-06b-ReachabilityCardinality-15
lola: result : true
lola: fired transitions : 14
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 24 (type EQUN) for StigmergyCommit-PT-06b-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 26 (type SRCH) for StigmergyCommit-PT-06b-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 27 (type EXCL) for StigmergyCommit-PT-06b-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
StigmergyCommit-PT-06b-ReachabilityCardinality-10: EF true tandem / insertion
StigmergyCommit-PT-06b-ReachabilityCardinality-13: AG false tandem / relaxed
StigmergyCommit-PT-06b-ReachabilityCardinality-15: AG false findpath
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-06b"
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-06b, 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-167912647400470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b 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 '
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 ;