About the Execution of LoLa+red for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3263.027 | 216358.00 | 3719226.00 | 108.80 | TFTFFTFTFTFTTTFT | 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-167903715600702.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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600702
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 1.9M 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 ShieldPPPt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679281752547
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=ShieldPPPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 03:09:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 03:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 03:09:15] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2023-03-20 03:09:15] [INFO ] Transformed 7803 places.
[2023-03-20 03:09:15] [INFO ] Transformed 7103 transitions.
[2023-03-20 03:09:15] [INFO ] Found NUPN structural information;
[2023-03-20 03:09:15] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 689 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 13) seen :4
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-20 03:09:17] [INFO ] Computed 1101 place invariants in 95 ms
[2023-03-20 03:09:20] [INFO ] After 3444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 03:09:24] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1149 ms returned sat
[2023-03-20 03:09:37] [INFO ] After 11608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 03:09:43] [INFO ] Deduced a trap composed of 26 places in 5125 ms of which 55 ms to minimize.
[2023-03-20 03:09:48] [INFO ] Deduced a trap composed of 23 places in 4713 ms of which 39 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:09:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:09:48] [INFO ] After 28080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3353 ms.
Support contains 112 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1824 transitions
Trivial Post-agglo rules discarded 1824 transitions
Performed 1824 trivial Post agglomeration. Transition count delta: 1824
Iterating post reduction 0 with 1824 rules applied. Total rules applied 1824 place count 7803 transition count 5279
Reduce places removed 1824 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1826 rules applied. Total rules applied 3650 place count 5979 transition count 5277
Reduce places removed 1 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 34 rules applied. Total rules applied 3684 place count 5978 transition count 5244
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 3717 place count 5945 transition count 5244
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 402 Pre rules applied. Total rules applied 3717 place count 5945 transition count 4842
Deduced a syphon composed of 402 places in 25 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 4 with 804 rules applied. Total rules applied 4521 place count 5543 transition count 4842
Discarding 679 places :
Symmetric choice reduction at 4 with 679 rule applications. Total rules 5200 place count 4864 transition count 4163
Iterating global reduction 4 with 679 rules applied. Total rules applied 5879 place count 4864 transition count 4163
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 5879 place count 4864 transition count 3882
Deduced a syphon composed of 281 places in 20 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 4 with 562 rules applied. Total rules applied 6441 place count 4583 transition count 3882
Performed 1644 Post agglomeration using F-continuation condition.Transition count delta: 1644
Deduced a syphon composed of 1644 places in 10 ms
Reduce places removed 1644 places and 0 transitions.
Iterating global reduction 4 with 3288 rules applied. Total rules applied 9729 place count 2939 transition count 2238
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9931 place count 2838 transition count 2238
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10133 place count 2737 transition count 2238
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 10289 place count 2659 transition count 2238
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 10296 place count 2659 transition count 2231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 10303 place count 2652 transition count 2231
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 5 with 290 rules applied. Total rules applied 10593 place count 2652 transition count 2231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10594 place count 2651 transition count 2230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10595 place count 2650 transition count 2230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10595 place count 2650 transition count 2228
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10599 place count 2648 transition count 2228
Applied a total of 10599 rules in 3669 ms. Remains 2648 /7803 variables (removed 5155) and now considering 2228/7103 (removed 4875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3671 ms. Remains : 2648/7803 places, 2228/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 42111 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42111 steps, saw 27209 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2228 rows 2648 cols
[2023-03-20 03:10:00] [INFO ] Computed 1100 place invariants in 15 ms
[2023-03-20 03:10:01] [INFO ] After 908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:10:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 353 ms returned sat
[2023-03-20 03:10:06] [INFO ] After 3408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 03:10:06] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-20 03:10:08] [INFO ] After 2164ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:10:09] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 2 ms to minimize.
[2023-03-20 03:10:09] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 2 ms to minimize.
[2023-03-20 03:10:10] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 17 ms to minimize.
[2023-03-20 03:10:10] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2023-03-20 03:10:11] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 1 ms to minimize.
[2023-03-20 03:10:11] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 1 ms to minimize.
[2023-03-20 03:10:11] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 0 ms to minimize.
[2023-03-20 03:10:12] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2023-03-20 03:10:12] [INFO ] Deduced a trap composed of 6 places in 371 ms of which 1 ms to minimize.
[2023-03-20 03:10:13] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 0 ms to minimize.
[2023-03-20 03:10:13] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2023-03-20 03:10:14] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 1 ms to minimize.
[2023-03-20 03:10:14] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2023-03-20 03:10:14] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 0 ms to minimize.
[2023-03-20 03:10:15] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 1 ms to minimize.
[2023-03-20 03:10:15] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2023-03-20 03:10:16] [INFO ] Deduced a trap composed of 8 places in 998 ms of which 1 ms to minimize.
[2023-03-20 03:10:17] [INFO ] Deduced a trap composed of 6 places in 373 ms of which 1 ms to minimize.
[2023-03-20 03:10:17] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 1 ms to minimize.
[2023-03-20 03:10:18] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-20 03:10:18] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-20 03:10:19] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-20 03:10:19] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 1 ms to minimize.
[2023-03-20 03:10:19] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10943 ms
[2023-03-20 03:10:20] [INFO ] Deduced a trap composed of 10 places in 422 ms of which 1 ms to minimize.
[2023-03-20 03:10:21] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 3 ms to minimize.
[2023-03-20 03:10:21] [INFO ] Deduced a trap composed of 8 places in 602 ms of which 1 ms to minimize.
[2023-03-20 03:10:22] [INFO ] Deduced a trap composed of 9 places in 986 ms of which 1 ms to minimize.
[2023-03-20 03:10:23] [INFO ] Deduced a trap composed of 6 places in 506 ms of which 0 ms to minimize.
[2023-03-20 03:10:24] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 0 ms to minimize.
[2023-03-20 03:10:24] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 1 ms to minimize.
[2023-03-20 03:10:25] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 1 ms to minimize.
[2023-03-20 03:10:25] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2023-03-20 03:10:25] [INFO ] Deduced a trap composed of 9 places in 378 ms of which 0 ms to minimize.
[2023-03-20 03:10:26] [INFO ] Deduced a trap composed of 9 places in 352 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:10:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:10:26] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 2313 ms.
Support contains 112 out of 2648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 153 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2648/2648 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 153 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-20 03:10:29] [INFO ] Invariant cache hit.
[2023-03-20 03:10:31] [INFO ] Implicit Places using invariants in 2816 ms returned [2629, 2633]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2825 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2646/2648 places, 2228/2228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2644 transition count 2226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2644 transition count 2226
Applied a total of 4 rules in 295 ms. Remains 2644 /2646 variables (removed 2) and now considering 2226/2228 (removed 2) transitions.
// Phase 1: matrix 2226 rows 2644 cols
[2023-03-20 03:10:32] [INFO ] Computed 1098 place invariants in 12 ms
[2023-03-20 03:10:35] [INFO ] Implicit Places using invariants in 3125 ms returned []
[2023-03-20 03:10:35] [INFO ] Invariant cache hit.
[2023-03-20 03:10:37] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-20 03:10:44] [INFO ] Implicit Places using invariants and state equation in 9412 ms returned []
Implicit Place search using SMT with State Equation took 12569 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2644/2648 places, 2226/2228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15843 ms. Remains : 2644/2648 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 40401 steps, run timeout after 3003 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40401 steps, saw 26052 distinct states, run finished after 3003 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-20 03:10:49] [INFO ] Invariant cache hit.
[2023-03-20 03:10:50] [INFO ] After 888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:10:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 307 ms returned sat
[2023-03-20 03:10:54] [INFO ] After 3009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 03:10:54] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-20 03:10:56] [INFO ] After 2053ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:10:58] [INFO ] Deduced a trap composed of 4 places in 916 ms of which 2 ms to minimize.
[2023-03-20 03:10:58] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 1 ms to minimize.
[2023-03-20 03:10:59] [INFO ] Deduced a trap composed of 5 places in 481 ms of which 1 ms to minimize.
[2023-03-20 03:11:00] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2023-03-20 03:11:00] [INFO ] Deduced a trap composed of 5 places in 455 ms of which 1 ms to minimize.
[2023-03-20 03:11:01] [INFO ] Deduced a trap composed of 7 places in 435 ms of which 1 ms to minimize.
[2023-03-20 03:11:01] [INFO ] Deduced a trap composed of 7 places in 585 ms of which 1 ms to minimize.
[2023-03-20 03:11:02] [INFO ] Deduced a trap composed of 5 places in 762 ms of which 3 ms to minimize.
[2023-03-20 03:11:03] [INFO ] Deduced a trap composed of 7 places in 533 ms of which 1 ms to minimize.
[2023-03-20 03:11:04] [INFO ] Deduced a trap composed of 3 places in 549 ms of which 1 ms to minimize.
[2023-03-20 03:11:04] [INFO ] Deduced a trap composed of 4 places in 535 ms of which 1 ms to minimize.
[2023-03-20 03:11:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 7727 ms
[2023-03-20 03:11:05] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 1 ms to minimize.
[2023-03-20 03:11:06] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 2 ms to minimize.
[2023-03-20 03:11:07] [INFO ] Deduced a trap composed of 6 places in 421 ms of which 1 ms to minimize.
[2023-03-20 03:11:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2069 ms
[2023-03-20 03:11:08] [INFO ] Deduced a trap composed of 7 places in 705 ms of which 13 ms to minimize.
[2023-03-20 03:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 963 ms
[2023-03-20 03:11:09] [INFO ] Deduced a trap composed of 7 places in 1055 ms of which 22 ms to minimize.
[2023-03-20 03:11:10] [INFO ] Deduced a trap composed of 7 places in 823 ms of which 2 ms to minimize.
[2023-03-20 03:11:11] [INFO ] Deduced a trap composed of 5 places in 906 ms of which 2 ms to minimize.
[2023-03-20 03:11:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3254 ms
[2023-03-20 03:11:12] [INFO ] After 17918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2263 ms.
[2023-03-20 03:11:15] [INFO ] After 24810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 551 ms.
Support contains 112 out of 2644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 131 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 114 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-20 03:11:15] [INFO ] Invariant cache hit.
[2023-03-20 03:11:18] [INFO ] Implicit Places using invariants in 2393 ms returned []
[2023-03-20 03:11:18] [INFO ] Invariant cache hit.
[2023-03-20 03:11:20] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-20 03:11:28] [INFO ] Implicit Places using invariants and state equation in 10455 ms returned []
Implicit Place search using SMT with State Equation took 12903 ms to find 0 implicit places.
[2023-03-20 03:11:28] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-20 03:11:28] [INFO ] Invariant cache hit.
[2023-03-20 03:11:31] [INFO ] Dead Transitions using invariants and state equation in 2489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15700 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Partial Free-agglomeration rule applied 564 times.
Drop transitions removed 564 transitions
Iterating global reduction 0 with 564 rules applied. Total rules applied 564 place count 2644 transition count 2226
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 565 place count 2644 transition count 2225
Applied a total of 565 rules in 494 ms. Remains 2644 /2644 variables (removed 0) and now considering 2225/2226 (removed 1) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2225 rows 2644 cols
[2023-03-20 03:11:31] [INFO ] Computed 1098 place invariants in 15 ms
[2023-03-20 03:11:32] [INFO ] After 823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 03:11:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 385 ms returned sat
[2023-03-20 03:11:37] [INFO ] After 2987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 03:11:37] [INFO ] State equation strengthened by 525 read => feed constraints.
[2023-03-20 03:11:41] [INFO ] After 4419ms SMT Verify possible using 525 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:11:43] [INFO ] Deduced a trap composed of 6 places in 932 ms of which 2 ms to minimize.
[2023-03-20 03:11:44] [INFO ] Deduced a trap composed of 5 places in 922 ms of which 2 ms to minimize.
[2023-03-20 03:11:44] [INFO ] Deduced a trap composed of 5 places in 732 ms of which 14 ms to minimize.
[2023-03-20 03:11:45] [INFO ] Deduced a trap composed of 5 places in 598 ms of which 1 ms to minimize.
[2023-03-20 03:11:46] [INFO ] Deduced a trap composed of 6 places in 1028 ms of which 2 ms to minimize.
[2023-03-20 03:11:48] [INFO ] Deduced a trap composed of 5 places in 1432 ms of which 3 ms to minimize.
[2023-03-20 03:11:49] [INFO ] Deduced a trap composed of 5 places in 929 ms of which 2 ms to minimize.
[2023-03-20 03:11:50] [INFO ] Deduced a trap composed of 7 places in 740 ms of which 1 ms to minimize.
[2023-03-20 03:11:51] [INFO ] Deduced a trap composed of 7 places in 887 ms of which 11 ms to minimize.
[2023-03-20 03:11:52] [INFO ] Deduced a trap composed of 5 places in 675 ms of which 18 ms to minimize.
[2023-03-20 03:11:53] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 2 ms to minimize.
[2023-03-20 03:11:53] [INFO ] Deduced a trap composed of 6 places in 800 ms of which 1 ms to minimize.
[2023-03-20 03:11:55] [INFO ] Deduced a trap composed of 5 places in 1489 ms of which 8 ms to minimize.
[2023-03-20 03:11:56] [INFO ] Deduced a trap composed of 13 places in 741 ms of which 3 ms to minimize.
[2023-03-20 03:11:57] [INFO ] Deduced a trap composed of 6 places in 874 ms of which 1 ms to minimize.
[2023-03-20 03:11:58] [INFO ] Deduced a trap composed of 7 places in 622 ms of which 1 ms to minimize.
[2023-03-20 03:11:58] [INFO ] Deduced a trap composed of 12 places in 570 ms of which 2 ms to minimize.
[2023-03-20 03:12:00] [INFO ] Deduced a trap composed of 8 places in 1054 ms of which 3 ms to minimize.
[2023-03-20 03:12:01] [INFO ] Deduced a trap composed of 6 places in 1099 ms of which 1 ms to minimize.
[2023-03-20 03:12:02] [INFO ] Deduced a trap composed of 12 places in 677 ms of which 1 ms to minimize.
[2023-03-20 03:12:02] [INFO ] Deduced a trap composed of 10 places in 685 ms of which 1 ms to minimize.
[2023-03-20 03:12:03] [INFO ] Deduced a trap composed of 8 places in 797 ms of which 2 ms to minimize.
[2023-03-20 03:12:05] [INFO ] Deduced a trap composed of 6 places in 1223 ms of which 2 ms to minimize.
[2023-03-20 03:12:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 23325 ms
[2023-03-20 03:12:06] [INFO ] Deduced a trap composed of 6 places in 499 ms of which 1 ms to minimize.
[2023-03-20 03:12:07] [INFO ] Deduced a trap composed of 9 places in 587 ms of which 2 ms to minimize.
[2023-03-20 03:12:08] [INFO ] Deduced a trap composed of 10 places in 825 ms of which 1 ms to minimize.
[2023-03-20 03:12:08] [INFO ] Deduced a trap composed of 7 places in 530 ms of which 1 ms to minimize.
[2023-03-20 03:12:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2960 ms
[2023-03-20 03:12:09] [INFO ] Deduced a trap composed of 5 places in 685 ms of which 1 ms to minimize.
[2023-03-20 03:12:10] [INFO ] Deduced a trap composed of 8 places in 668 ms of which 1 ms to minimize.
[2023-03-20 03:12:11] [INFO ] Deduced a trap composed of 5 places in 617 ms of which 1 ms to minimize.
[2023-03-20 03:12:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2401 ms
[2023-03-20 03:12:12] [INFO ] Deduced a trap composed of 5 places in 671 ms of which 1 ms to minimize.
[2023-03-20 03:12:13] [INFO ] Deduced a trap composed of 4 places in 807 ms of which 1 ms to minimize.
[2023-03-20 03:12:14] [INFO ] Deduced a trap composed of 5 places in 821 ms of which 2 ms to minimize.
[2023-03-20 03:12:14] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 1 ms to minimize.
[2023-03-20 03:12:15] [INFO ] Deduced a trap composed of 5 places in 569 ms of which 1 ms to minimize.
[2023-03-20 03:12:16] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 1 ms to minimize.
[2023-03-20 03:12:16] [INFO ] Deduced a trap composed of 10 places in 622 ms of which 1 ms to minimize.
[2023-03-20 03:12:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5451 ms
[2023-03-20 03:12:21] [INFO ] Deduced a trap composed of 4 places in 1245 ms of which 3 ms to minimize.
[2023-03-20 03:12:22] [INFO ] Deduced a trap composed of 6 places in 680 ms of which 1 ms to minimize.
[2023-03-20 03:12:22] [INFO ] Deduced a trap composed of 5 places in 692 ms of which 2 ms to minimize.
[2023-03-20 03:12:23] [INFO ] Deduced a trap composed of 5 places in 662 ms of which 1 ms to minimize.
[2023-03-20 03:12:25] [INFO ] Deduced a trap composed of 6 places in 1510 ms of which 1 ms to minimize.
[2023-03-20 03:12:26] [INFO ] Deduced a trap composed of 9 places in 692 ms of which 28 ms to minimize.
[2023-03-20 03:12:26] [INFO ] Deduced a trap composed of 9 places in 547 ms of which 1 ms to minimize.
[2023-03-20 03:12:28] [INFO ] Deduced a trap composed of 5 places in 969 ms of which 2 ms to minimize.
[2023-03-20 03:12:28] [INFO ] Deduced a trap composed of 7 places in 590 ms of which 1 ms to minimize.
[2023-03-20 03:12:29] [INFO ] Deduced a trap composed of 9 places in 697 ms of which 2 ms to minimize.
[2023-03-20 03:12:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9886 ms
[2023-03-20 03:12:30] [INFO ] After 53105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 7462 ms.
[2023-03-20 03:12:37] [INFO ] After 65124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-20 03:12:38] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 21 ms.
[2023-03-20 03:12:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2644 places, 2226 transitions and 9712 arcs took 17 ms.
[2023-03-20 03:12:38] [INFO ] Flatten gal took : 247 ms
Total runtime 203684 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-100B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityCardinality
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679281968905
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12880480 kB
After kill :
MemTotal: 16393220 kB
MemFree: 12879984 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.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 # 29 (type EXCL) for 6 ShieldPPPt-PT-100B-ReachabilityCardinality-04
lola: time limit : 448 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 6 ShieldPPPt-PT-100B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 6 ShieldPPPt-PT-100B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 6 ShieldPPPt-PT-100B-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 # 28 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-04
lola: result : true
lola: markings : 240
lola: fired transitions : 239
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldPPPt-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 35 (type EXCL) for 12 ShieldPPPt-PT-100B-ReachabilityCardinality-09
lola: time limit : 512 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 31 (type FNDP) for 12 ShieldPPPt-PT-100B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 12 ShieldPPPt-PT-100B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 12 ShieldPPPt-PT-100B-ReachabilityCardinality-09
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 # 31 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 91
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 32 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 34 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 35 (type EXCL) for ShieldPPPt-PT-100B-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 41 (type EXCL) for 9 ShieldPPPt-PT-100B-ReachabilityCardinality-07
lola: time limit : 598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 37 (type FNDP) for 9 ShieldPPPt-PT-100B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type EQUN) for 9 ShieldPPPt-PT-100B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 9 ShieldPPPt-PT-100B-ReachabilityCardinality-07
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
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-32.sara.
lola: FINISHED task # 37 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-07
lola: result : true
lola: fired transitions : 76
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 38 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 40 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldPPPt-PT-100B-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 47 (type EXCL) for 15 ShieldPPPt-PT-100B-ReachabilityCardinality-12
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 15 ShieldPPPt-PT-100B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 15 ShieldPPPt-PT-100B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type SRCH) for 15 ShieldPPPt-PT-100B-ReachabilityCardinality-12
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: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: 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
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-38.sara.
lola: FINISHED task # 46 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-12
lola: result : true
lola: markings : 136
lola: fired transitions : 135
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 43 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 44 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 47 (type EXCL) for ShieldPPPt-PT-100B-ReachabilityCardinality-12 (obsolete)
lola: LAUNCH task # 60 (type EXCL) for 3 ShieldPPPt-PT-100B-ReachabilityCardinality-02
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 50 (type FNDP) for 0 ShieldPPPt-PT-100B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 0 ShieldPPPt-PT-100B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 53 (type SRCH) for 0 ShieldPPPt-PT-100B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 43 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 134
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: FINISHED task # 50 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-01
lola: result : true
lola: fired transitions : 229
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 51 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 53 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-01 (obsolete)
lola: LAUNCH task # 62 (type FNDP) for 18 ShieldPPPt-PT-100B-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type EQUN) for 18 ShieldPPPt-PT-100B-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 65 (type SRCH) for 18 ShieldPPPt-PT-100B-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 62 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-13
lola: result : true
lola: fired transitions : 204
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 63 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 65 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-13 (obsolete)
lola: LAUNCH task # 69 (type FNDP) for 21 ShieldPPPt-PT-100B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 70 (type EQUN) for 21 ShieldPPPt-PT-100B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 72 (type SRCH) for 21 ShieldPPPt-PT-100B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 65 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-13
lola: result : true
lola: markings : 206
lola: fired transitions : 205
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 72 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-14
lola: result : true
lola: markings : 108
lola: fired transitions : 107
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 69 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 70 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 56 (type FNDP) for 3 ShieldPPPt-PT-100B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type EQUN) for 3 ShieldPPPt-PT-100B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 3 ShieldPPPt-PT-100B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 56 (type FNDP) for ShieldPPPt-PT-100B-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 73
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 57 (type EQUN) for ShieldPPPt-PT-100B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 59 (type SRCH) for ShieldPPPt-PT-100B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 60 (type EXCL) for ShieldPPPt-PT-100B-ReachabilityCardinality-02 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-ReachabilityCardinality-01: AG false findpath
ShieldPPPt-PT-100B-ReachabilityCardinality-02: EF true findpath
ShieldPPPt-PT-100B-ReachabilityCardinality-04: AG false tandem / insertion
ShieldPPPt-PT-100B-ReachabilityCardinality-07: EF true findpath
ShieldPPPt-PT-100B-ReachabilityCardinality-09: EF true findpath
ShieldPPPt-PT-100B-ReachabilityCardinality-12: EF true tandem / insertion
ShieldPPPt-PT-100B-ReachabilityCardinality-13: EF true findpath
ShieldPPPt-PT-100B-ReachabilityCardinality-14: AG false tandem / insertion
Time elapsed: 10 secs. Pages in use: 3
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-63.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1623)
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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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-167903715600702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;