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.r007-oct2-167813595100143.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595100143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 839K Mar 5 18:22 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 ASLink-PT-09a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678342301464

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 06:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 06:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:11:44] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-09 06:11:44] [INFO ] Transformed 1991 places.
[2023-03-09 06:11:44] [INFO ] Transformed 2919 transitions.
[2023-03-09 06:11:44] [INFO ] Found NUPN structural information;
[2023-03-09 06:11:44] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA ASLink-PT-09a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2888 rows 1991 cols
[2023-03-09 06:11:45] [INFO ] Computed 384 place invariants in 135 ms
[2023-03-09 06:11:46] [INFO ] After 1126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 06:11:47] [INFO ] [Nat]Absence check using 93 positive place invariants in 75 ms returned sat
[2023-03-09 06:11:47] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 153 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-09 06:12:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 06:12:11] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ASLink-PT-09a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 87 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 1937 transition count 2711
Reduce places removed 177 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 180 rules applied. Total rules applied 411 place count 1760 transition count 2708
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 414 place count 1757 transition count 2708
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 414 place count 1757 transition count 2525
Deduced a syphon composed of 183 places in 4 ms
Ensure Unique test removed 71 places
Reduce places removed 254 places and 0 transitions.
Iterating global reduction 3 with 437 rules applied. Total rules applied 851 place count 1503 transition count 2525
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 852 place count 1503 transition count 2524
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 853 place count 1502 transition count 2524
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 864 place count 1491 transition count 2465
Ensure Unique test removed 1 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 876 place count 1490 transition count 2465
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 882 place count 1489 transition count 2460
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 885 place count 1486 transition count 2460
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 886 place count 1485 transition count 2452
Iterating global reduction 7 with 1 rules applied. Total rules applied 887 place count 1485 transition count 2452
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 10 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 1003 place count 1427 transition count 2394
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1010 place count 1427 transition count 2387
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1017 place count 1420 transition count 2387
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1027 place count 1420 transition count 2387
Applied a total of 1027 rules in 879 ms. Remains 1420 /1991 variables (removed 571) and now considering 2387/2888 (removed 501) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 880 ms. Remains : 1420/1991 places, 2387/2888 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 122891 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122891 steps, saw 37182 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2387 rows 1420 cols
[2023-03-09 06:12:16] [INFO ] Computed 257 place invariants in 47 ms
[2023-03-09 06:12:17] [INFO ] [Real]Absence check using 70 positive place invariants in 122 ms returned sat
[2023-03-09 06:12:17] [INFO ] [Real]Absence check using 70 positive and 187 generalized place invariants in 70 ms returned sat
[2023-03-09 06:12:17] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 06:12:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 34 ms returned sat
[2023-03-09 06:12:18] [INFO ] [Nat]Absence check using 70 positive and 187 generalized place invariants in 211 ms returned sat
[2023-03-09 06:12:36] [INFO ] After 17763ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-09 06:12:36] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 06:12:40] [INFO ] After 4106ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :6 sat :2
[2023-03-09 06:12:41] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 23 ms to minimize.
[2023-03-09 06:12:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2023-03-09 06:12:42] [INFO ] After 5903ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 06:12:42] [INFO ] After 25055ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA ASLink-PT-09a-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-09a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 76 out of 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2387/2387 transitions.
Applied a total of 0 rules in 103 ms. Remains 1420 /1420 variables (removed 0) and now considering 2387/2387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 1420/1420 places, 2387/2387 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 143255 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143255 steps, saw 46437 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 06:12:46] [INFO ] Invariant cache hit.
[2023-03-09 06:12:46] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 06:12:46] [INFO ] [Nat]Absence check using 70 positive place invariants in 33 ms returned sat
[2023-03-09 06:12:46] [INFO ] [Nat]Absence check using 70 positive and 187 generalized place invariants in 77 ms returned sat
[2023-03-09 06:12:57] [INFO ] After 10619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 06:12:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 06:12:59] [INFO ] After 1661ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 06:13:00] [INFO ] Deduced a trap composed of 104 places in 316 ms of which 2 ms to minimize.
[2023-03-09 06:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2023-03-09 06:13:00] [INFO ] After 3061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4806 ms.
[2023-03-09 06:13:05] [INFO ] After 19000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 91 ms.
Support contains 76 out of 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2387/2387 transitions.
Applied a total of 0 rules in 51 ms. Remains 1420 /1420 variables (removed 0) and now considering 2387/2387 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1420/1420 places, 2387/2387 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 2387/2387 transitions.
Applied a total of 0 rules in 52 ms. Remains 1420 /1420 variables (removed 0) and now considering 2387/2387 (removed 0) transitions.
[2023-03-09 06:13:05] [INFO ] Invariant cache hit.
[2023-03-09 06:13:06] [INFO ] Implicit Places using invariants in 1206 ms returned [1, 19, 20, 22, 32, 50, 68, 106, 150, 163, 164, 165, 166, 167, 185, 203, 283, 296, 297, 298, 299, 319, 337, 405, 419, 432, 433, 434, 435, 436, 454, 472, 525, 555, 570, 571, 572, 573, 574, 610, 691, 704, 705, 706, 707, 708, 726, 744, 826, 839, 840, 841, 842, 843, 861, 879, 952, 965, 978, 979, 980, 982, 1000, 1018, 1099, 1112, 1113, 1114, 1115, 1116, 1134, 1152, 1233, 1238, 1249, 1250, 1251, 1252, 1253, 1286, 1288, 1309, 1310, 1311, 1312, 1324, 1330, 1336, 1342, 1348, 1354, 1360, 1366, 1372, 1378, 1384]
Discarding 96 places :
Implicit Place search using SMT only with invariants took 1224 ms to find 96 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1324/1420 places, 2387/2387 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1324 transition count 2267
Reduce places removed 120 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 136 rules applied. Total rules applied 256 place count 1204 transition count 2251
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 272 place count 1188 transition count 2251
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 272 place count 1188 transition count 2186
Deduced a syphon composed of 65 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 403 place count 1122 transition count 2186
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 43 rules applied. Total rules applied 446 place count 1101 transition count 2164
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 23 rules applied. Total rules applied 469 place count 1079 transition count 2163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 470 place count 1078 transition count 2163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 470 place count 1078 transition count 2162
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 472 place count 1077 transition count 2162
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 487 place count 1062 transition count 2147
Iterating global reduction 6 with 15 rules applied. Total rules applied 502 place count 1062 transition count 2147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 506 place count 1062 transition count 2143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 506 place count 1062 transition count 2142
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 1061 transition count 2142
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 516 place count 1053 transition count 2134
Iterating global reduction 7 with 8 rules applied. Total rules applied 524 place count 1053 transition count 2134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 525 place count 1053 transition count 2133
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 526 place count 1052 transition count 2132
Iterating global reduction 8 with 1 rules applied. Total rules applied 527 place count 1052 transition count 2132
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 528 place count 1051 transition count 2131
Iterating global reduction 8 with 1 rules applied. Total rules applied 529 place count 1051 transition count 2131
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 8 with 136 rules applied. Total rules applied 665 place count 983 transition count 2063
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 671 place count 977 transition count 2057
Iterating global reduction 8 with 6 rules applied. Total rules applied 677 place count 977 transition count 2057
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 682 place count 977 transition count 2052
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 683 place count 977 transition count 2051
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 685 place count 976 transition count 2050
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 693 place count 976 transition count 2042
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 707 place count 968 transition count 2036
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 10 with 24 rules applied. Total rules applied 731 place count 968 transition count 2012
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 756 place count 943 transition count 2012
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 781 place count 943 transition count 2012
Applied a total of 781 rules in 682 ms. Remains 943 /1324 variables (removed 381) and now considering 2012/2387 (removed 375) transitions.
// Phase 1: matrix 2012 rows 943 cols
[2023-03-09 06:13:07] [INFO ] Computed 138 place invariants in 19 ms
[2023-03-09 06:13:08] [INFO ] Implicit Places using invariants in 668 ms returned [92, 98, 101, 103, 109, 161, 178, 184, 187, 189, 190, 195, 196, 251, 272, 278, 281, 286, 290, 295, 296, 348, 373, 376, 378, 379, 384, 385, 438, 459, 468, 474, 475, 480, 481, 534, 563, 566, 568, 575, 580, 581, 633, 666, 675, 680, 681, 734, 752, 758, 761, 763, 764, 769, 770, 822, 839, 846, 849, 851, 852]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 686 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 882/1420 places, 2012/2387 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 882 transition count 2011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 881 transition count 2011
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 863 transition count 1993
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 863 transition count 1993
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 858 transition count 1988
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 858 transition count 1988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 857 transition count 1987
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 857 transition count 1987
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 80 place count 842 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 841 transition count 1970
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 841 transition count 1970
Free-agglomeration rule applied 22 times.
Iterating global reduction 2 with 22 rules applied. Total rules applied 104 place count 841 transition count 1948
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 126 place count 819 transition count 1948
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 819 transition count 1943
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 814 transition count 1943
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 814 transition count 1943
Applied a total of 137 rules in 256 ms. Remains 814 /882 variables (removed 68) and now considering 1943/2012 (removed 69) transitions.
// Phase 1: matrix 1943 rows 814 cols
[2023-03-09 06:13:08] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-09 06:13:08] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-09 06:13:08] [INFO ] Invariant cache hit.
[2023-03-09 06:13:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 06:13:11] [INFO ] Implicit Places using invariants and state equation in 2634 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 814/1420 places, 1943/2387 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6026 ms. Remains : 814/1420 places, 1943/2387 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 130348 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130348 steps, saw 56922 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 06:13:15] [INFO ] Invariant cache hit.
[2023-03-09 06:13:15] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 06:13:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 82 ms returned sat
[2023-03-09 06:13:15] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 83 ms returned sat
[2023-03-09 06:13:26] [INFO ] After 10548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 06:13:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 06:13:35] [INFO ] After 9392ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 06:13:35] [INFO ] After 9578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-09 06:13:35] [INFO ] After 20562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 76 out of 814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 814/814 places, 1943/1943 transitions.
Applied a total of 0 rules in 50 ms. Remains 814 /814 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 814/814 places, 1943/1943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 814/814 places, 1943/1943 transitions.
Applied a total of 0 rules in 48 ms. Remains 814 /814 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
[2023-03-09 06:13:36] [INFO ] Invariant cache hit.
[2023-03-09 06:13:36] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-09 06:13:36] [INFO ] Invariant cache hit.
[2023-03-09 06:13:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 06:13:38] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2023-03-09 06:13:39] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-09 06:13:39] [INFO ] Invariant cache hit.
[2023-03-09 06:13:39] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4055 ms. Remains : 814/814 places, 1943/1943 transitions.
Applied a total of 0 rules in 23 ms. Remains 814 /814 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-09 06:13:40] [INFO ] Invariant cache hit.
[2023-03-09 06:13:40] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 06:13:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-09 06:13:40] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 25 ms returned sat
[2023-03-09 06:13:51] [INFO ] After 11284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 06:14:00] [INFO ] After 19984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3797 ms.
[2023-03-09 06:14:04] [INFO ] After 24015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 06:14:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-09 06:14:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 814 places, 1943 transitions and 7795 arcs took 8 ms.
[2023-03-09 06:14:04] [INFO ] Flatten gal took : 194 ms
Total runtime 140842 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-09a
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
ReachabilityFireability

FORMULA ASLink-PT-09a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-09a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-09a-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678342455940

--------------------
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 ReachabilityFireability -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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/ReachabilityFireability.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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 17 (type EXCL) for 0 ASLink-PT-09a-ReachabilityFireability-05
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 6 ASLink-PT-09a-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 6 ASLink-PT-09a-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SRCH) for 6 ASLink-PT-09a-ReachabilityFireability-15
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 13 (type FNDP) for ASLink-PT-09a-ReachabilityFireability-15
lola: result : true
lola: fired transitions : 264
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for ASLink-PT-09a-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 18 (type SRCH) for ASLink-PT-09a-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 22 (type FNDP) for 3 ASLink-PT-09a-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 3 ASLink-PT-09a-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 3 ASLink-PT-09a-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-14.sara.
lola: FINISHED task # 23 (type EQUN) for ASLink-PT-09a-ReachabilityFireability-13
lola: result : unknown
lola: LAUNCH task # 10 (type FNDP) for 0 ASLink-PT-09a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-09a-ReachabilityFireability-15: EF true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ASLink-PT-09a-ReachabilityFireability-05: AG 0 3 2 0 1 0 0 0
ASLink-PT-09a-ReachabilityFireability-13: EF 0 2 2 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 EF FNDP 5/1199 0/5 ASLink-PT-09a-ReachabilityFireability-05 404970 t fired, 7694 attempts, .
17 EF EXCL 5/1799 2/32 ASLink-PT-09a-ReachabilityFireability-05 310275 m, 62055 m/sec, 364308 t fired, .
22 EF FNDP 5/1799 0/5 ASLink-PT-09a-ReachabilityFireability-13 346417 t fired, 3732 attempts, .
25 EF SRCH 5/1799 4/5 ASLink-PT-09a-ReachabilityFireability-13 469810 m, 93962 m/sec, 470011 t fired, .

Time elapsed: 6 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 3
lola: CANCELED task # 25 (type SRCH) for ASLink-PT-09a-ReachabilityFireability-13 (memory limit exceeded)
lola: FINISHED task # 22 (type FNDP) for ASLink-PT-09a-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 729924
lola: tried executions : 9494
lola: time used : 9.000000
lola: memory pages used : 0
lola: LAUNCH task # 11 (type EQUN) for 0 ASLink-PT-09a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 ASLink-PT-09a-ReachabilityFireability-05
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
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 11 (type EQUN) for ASLink-PT-09a-ReachabilityFireability-05
lola: result : true
lola: CANCELED task # 10 (type FNDP) for ASLink-PT-09a-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 16 (type SRCH) for ASLink-PT-09a-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ASLink-PT-09a-ReachabilityFireability-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-09a-ReachabilityFireability-05: AG false state equation
ASLink-PT-09a-ReachabilityFireability-13: EF true findpath
ASLink-PT-09a-ReachabilityFireability-15: EF true findpath


Time elapsed: 10 secs. Pages in use: 9

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="ASLink-PT-09a"
export BK_EXAMINATION="ReachabilityFireability"
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 ASLink-PT-09a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595100143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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