fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903715300494
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldPPPs-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1326.739 97984.00 132011.00 43.20 FTTFFTTFFTFTTFTF 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.r391-oct2-167903715300494.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 ShieldPPPs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715300494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 708K 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 ShieldPPPs-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679276538360

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=ShieldPPPs-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:42:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 01:42:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:42:20] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-20 01:42:20] [INFO ] Transformed 2723 places.
[2023-03-20 01:42:20] [INFO ] Transformed 2523 transitions.
[2023-03-20 01:42:20] [INFO ] Found NUPN structural information;
[2023-03-20 01:42:20] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 14) seen :8
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-20 01:42:21] [INFO ] Computed 441 place invariants in 25 ms
[2023-03-20 01:42:22] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 01:42:23] [INFO ] [Nat]Absence check using 441 positive place invariants in 250 ms returned sat
[2023-03-20 01:42:27] [INFO ] After 3304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 01:42:28] [INFO ] Deduced a trap composed of 26 places in 882 ms of which 27 ms to minimize.
[2023-03-20 01:42:29] [INFO ] Deduced a trap composed of 14 places in 815 ms of which 3 ms to minimize.
[2023-03-20 01:42:30] [INFO ] Deduced a trap composed of 20 places in 707 ms of which 14 ms to minimize.
[2023-03-20 01:42:31] [INFO ] Deduced a trap composed of 21 places in 575 ms of which 1 ms to minimize.
[2023-03-20 01:42:33] [INFO ] Deduced a trap composed of 18 places in 823 ms of which 6 ms to minimize.
[2023-03-20 01:42:34] [INFO ] Deduced a trap composed of 21 places in 991 ms of which 4 ms to minimize.
[2023-03-20 01:42:35] [INFO ] Deduced a trap composed of 34 places in 951 ms of which 2 ms to minimize.
[2023-03-20 01:42:36] [INFO ] Deduced a trap composed of 22 places in 819 ms of which 2 ms to minimize.
[2023-03-20 01:42:37] [INFO ] Deduced a trap composed of 32 places in 844 ms of which 1 ms to minimize.
[2023-03-20 01:42:38] [INFO ] Deduced a trap composed of 36 places in 810 ms of which 2 ms to minimize.
[2023-03-20 01:42:39] [INFO ] Deduced a trap composed of 35 places in 803 ms of which 2 ms to minimize.
[2023-03-20 01:42:40] [INFO ] Deduced a trap composed of 31 places in 700 ms of which 2 ms to minimize.
[2023-03-20 01:42:41] [INFO ] Deduced a trap composed of 23 places in 705 ms of which 3 ms to minimize.
[2023-03-20 01:42:41] [INFO ] Deduced a trap composed of 33 places in 744 ms of which 1 ms to minimize.
[2023-03-20 01:42:43] [INFO ] Deduced a trap composed of 25 places in 863 ms of which 2 ms to minimize.
[2023-03-20 01:42:43] [INFO ] Deduced a trap composed of 29 places in 761 ms of which 2 ms to minimize.
[2023-03-20 01:42:44] [INFO ] Deduced a trap composed of 35 places in 815 ms of which 2 ms to minimize.
[2023-03-20 01:42:45] [INFO ] Deduced a trap composed of 25 places in 806 ms of which 2 ms to minimize.
[2023-03-20 01:42:46] [INFO ] Deduced a trap composed of 28 places in 671 ms of which 2 ms to minimize.
[2023-03-20 01:42:47] [INFO ] Deduced a trap composed of 26 places in 717 ms of which 2 ms to minimize.
[2023-03-20 01:42:48] [INFO ] Deduced a trap composed of 27 places in 649 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:42:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:42:48] [INFO ] After 25362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 396 ms.
Support contains 51 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 261 rules applied. Total rules applied 261 place count 2723 transition count 2262
Reduce places removed 261 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 270 rules applied. Total rules applied 531 place count 2462 transition count 2253
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 540 place count 2453 transition count 2253
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 540 place count 2453 transition count 2054
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 938 place count 2254 transition count 2054
Discarding 269 places :
Symmetric choice reduction at 3 with 269 rule applications. Total rules 1207 place count 1985 transition count 1785
Iterating global reduction 3 with 269 rules applied. Total rules applied 1476 place count 1985 transition count 1785
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 1476 place count 1985 transition count 1674
Deduced a syphon composed of 111 places in 10 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 1698 place count 1874 transition count 1674
Performed 576 Post agglomeration using F-continuation condition.Transition count delta: 576
Deduced a syphon composed of 576 places in 2 ms
Reduce places removed 576 places and 0 transitions.
Iterating global reduction 3 with 1152 rules applied. Total rules applied 2850 place count 1298 transition count 1098
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 341 times.
Drop transitions removed 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 3191 place count 1298 transition count 1098
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3192 place count 1297 transition count 1097
Applied a total of 3192 rules in 1252 ms. Remains 1297 /2723 variables (removed 1426) and now considering 1097/2523 (removed 1426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 1297/2723 places, 1097/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1097 rows 1297 cols
[2023-03-20 01:42:50] [INFO ] Computed 441 place invariants in 34 ms
[2023-03-20 01:42:50] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:42:50] [INFO ] [Nat]Absence check using 416 positive place invariants in 114 ms returned sat
[2023-03-20 01:42:50] [INFO ] [Nat]Absence check using 416 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-20 01:42:58] [INFO ] After 7402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:42:58] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2023-03-20 01:42:58] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:42:59] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-20 01:42:59] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-20 01:42:59] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:42:59] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-20 01:42:59] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-20 01:43:00] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:43:00] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-20 01:43:00] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:43:00] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-20 01:43:01] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-20 01:43:01] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 4 ms to minimize.
[2023-03-20 01:43:01] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2023-03-20 01:43:01] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:43:02] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-20 01:43:02] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 01:43:02] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-20 01:43:02] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 13 ms to minimize.
[2023-03-20 01:43:02] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-20 01:43:03] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 0 ms to minimize.
[2023-03-20 01:43:03] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-20 01:43:03] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:43:03] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-20 01:43:03] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:43:04] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-03-20 01:43:04] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5961 ms
[2023-03-20 01:43:11] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-20 01:43:11] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 0 ms to minimize.
[2023-03-20 01:43:11] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:43:12] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 14 ms to minimize.
[2023-03-20 01:43:12] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2023-03-20 01:43:12] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:43:12] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 0 ms to minimize.
[2023-03-20 01:43:13] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:43:13] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:43:13] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:43:14] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-20 01:43:14] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 2 ms to minimize.
[2023-03-20 01:43:14] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-20 01:43:14] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-20 01:43:15] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 1 ms to minimize.
[2023-03-20 01:43:15] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 4230 ms
[2023-03-20 01:43:15] [INFO ] After 24672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 01:43:15] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 95 ms.
Support contains 47 out of 1297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1297/1297 places, 1097/1097 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1295 transition count 1095
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1295 transition count 1095
Applied a total of 5 rules in 134 ms. Remains 1295 /1297 variables (removed 2) and now considering 1095/1097 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 1295/1297 places, 1095/1097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 127915 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127915 steps, saw 89787 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1095 rows 1295 cols
[2023-03-20 01:43:18] [INFO ] Computed 441 place invariants in 21 ms
[2023-03-20 01:43:19] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:43:19] [INFO ] [Nat]Absence check using 415 positive place invariants in 135 ms returned sat
[2023-03-20 01:43:19] [INFO ] [Nat]Absence check using 415 positive and 26 generalized place invariants in 64 ms returned sat
[2023-03-20 01:43:29] [INFO ] After 9705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:43:29] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2023-03-20 01:43:30] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:43:30] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 1 ms to minimize.
[2023-03-20 01:43:30] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 0 ms to minimize.
[2023-03-20 01:43:31] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 35 ms to minimize.
[2023-03-20 01:43:31] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 8 ms to minimize.
[2023-03-20 01:43:31] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:43:32] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-20 01:43:32] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-20 01:43:32] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-20 01:43:32] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:43:34] [INFO ] Deduced a trap composed of 5 places in 1311 ms of which 1 ms to minimize.
[2023-03-20 01:43:34] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-20 01:43:34] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-20 01:43:34] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-20 01:43:34] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:43:35] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:43:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5698 ms
[2023-03-20 01:43:35] [INFO ] After 15488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-20 01:43:35] [INFO ] After 16066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 47 out of 1295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1295/1295 places, 1095/1095 transitions.
Applied a total of 0 rules in 39 ms. Remains 1295 /1295 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1295/1295 places, 1095/1095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1295/1295 places, 1095/1095 transitions.
Applied a total of 0 rules in 35 ms. Remains 1295 /1295 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2023-03-20 01:43:35] [INFO ] Invariant cache hit.
[2023-03-20 01:43:36] [INFO ] Implicit Places using invariants in 872 ms returned []
[2023-03-20 01:43:36] [INFO ] Invariant cache hit.
[2023-03-20 01:43:38] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
[2023-03-20 01:43:38] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-20 01:43:38] [INFO ] Invariant cache hit.
[2023-03-20 01:43:38] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3477 ms. Remains : 1295/1295 places, 1095/1095 transitions.
Applied a total of 0 rules in 39 ms. Remains 1295 /1295 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:43:38] [INFO ] Invariant cache hit.
[2023-03-20 01:43:39] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:43:39] [INFO ] [Nat]Absence check using 415 positive place invariants in 81 ms returned sat
[2023-03-20 01:43:39] [INFO ] [Nat]Absence check using 415 positive and 26 generalized place invariants in 4 ms returned sat
[2023-03-20 01:43:48] [INFO ] After 9620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:43:49] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2023-03-20 01:43:49] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 0 ms to minimize.
[2023-03-20 01:43:49] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:43:50] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
[2023-03-20 01:43:50] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-20 01:43:50] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:43:50] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 01:43:50] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-20 01:43:51] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-20 01:43:51] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-20 01:43:51] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2023-03-20 01:43:51] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-20 01:43:51] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:43:52] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 0 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2023-03-20 01:43:53] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2023-03-20 01:43:54] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 0 ms to minimize.
[2023-03-20 01:43:54] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:43:54] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5396 ms
[2023-03-20 01:43:54] [INFO ] After 15102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-20 01:43:54] [INFO ] After 15470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:43:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 32 ms.
[2023-03-20 01:43:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1295 places, 1095 transitions and 4995 arcs took 5 ms.
[2023-03-20 01:43:54] [INFO ] Flatten gal took : 158 ms
Total runtime 94450 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-040B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityCardinality

FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679276636344

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
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 # 11 (type EXCL) for 0 ShieldPPPs-PT-040B-ReachabilityCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 ShieldPPPs-PT-040B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 ShieldPPPs-PT-040B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 0 ShieldPPPs-PT-040B-ReachabilityCardinality-04
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: FINISHED task # 10 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityCardinality-04
lola: result : true
lola: markings : 29
lola: fired transitions : 28
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 8 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldPPPs-PT-040B-ReachabilityCardinality-04 (obsolete)
lola: FINISHED task # 7 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 27
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/376/ReachabilityCardinality-8.sara.
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 # 18 (type EXCL) for 3 ShieldPPPs-PT-040B-ReachabilityCardinality-07
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 3 ShieldPPPs-PT-040B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 3 ShieldPPPs-PT-040B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SRCH) for 3 ShieldPPPs-PT-040B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 17 (type SRCH) for ShieldPPPs-PT-040B-ReachabilityCardinality-07
lola: result : true
lola: markings : 64
lola: fired transitions : 63
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for ShieldPPPs-PT-040B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 15 (type EQUN) for ShieldPPPs-PT-040B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 18 (type EXCL) for ShieldPPPs-PT-040B-ReachabilityCardinality-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-040B-ReachabilityCardinality-04: AG false tandem / insertion
ShieldPPPs-PT-040B-ReachabilityCardinality-07: AG false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787

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="ShieldPPPs-PT-040B"
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 ShieldPPPs-PT-040B, 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 r391-oct2-167903715300494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;