About the Execution of LoLa+red for ShieldIIPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1000.195 | 240089.00 | 311852.00 | 58.50 | TFTFFFFFTFFTFFTF | 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-167903715000174.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 ShieldIIPs-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-167903715000174
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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.7M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679269439863
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=ShieldIIPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:44:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:44:02] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-19 23:44:02] [INFO ] Transformed 6003 places.
[2023-03-19 23:44:02] [INFO ] Transformed 5903 transitions.
[2023-03-19 23:44:02] [INFO ] Found NUPN structural information;
[2023-03-19 23:44:02] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 14) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-19 23:44:03] [INFO ] Computed 901 place invariants in 59 ms
[2023-03-19 23:44:05] [INFO ] After 1869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 23:44:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 744 ms returned sat
[2023-03-19 23:44:30] [INFO ] After 21155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:44:30] [INFO ] After 21199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 23:44:30] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 9 Parikh solutions to 4 different solutions.
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 923 ms.
Support contains 145 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 6003 transition count 5435
Reduce places removed 468 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 481 rules applied. Total rules applied 949 place count 5535 transition count 5422
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 962 place count 5522 transition count 5422
Performed 488 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 488 Pre rules applied. Total rules applied 962 place count 5522 transition count 4934
Deduced a syphon composed of 488 places in 29 ms
Reduce places removed 488 places and 0 transitions.
Iterating global reduction 3 with 976 rules applied. Total rules applied 1938 place count 5034 transition count 4934
Discarding 663 places :
Symmetric choice reduction at 3 with 663 rule applications. Total rules 2601 place count 4371 transition count 4271
Iterating global reduction 3 with 663 rules applied. Total rules applied 3264 place count 4371 transition count 4271
Performed 271 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 271 Pre rules applied. Total rules applied 3264 place count 4371 transition count 4000
Deduced a syphon composed of 271 places in 24 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 3806 place count 4100 transition count 4000
Performed 1426 Post agglomeration using F-continuation condition.Transition count delta: 1426
Deduced a syphon composed of 1426 places in 40 ms
Reduce places removed 1426 places and 0 transitions.
Iterating global reduction 3 with 2852 rules applied. Total rules applied 6658 place count 2674 transition count 2574
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 669 times.
Drop transitions removed 669 transitions
Iterating global reduction 3 with 669 rules applied. Total rules applied 7327 place count 2674 transition count 2574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7328 place count 2673 transition count 2573
Applied a total of 7328 rules in 2071 ms. Remains 2673 /6003 variables (removed 3330) and now considering 2573/5903 (removed 3330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2072 ms. Remains : 2673/6003 places, 2573/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 8) seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2573 rows 2673 cols
[2023-03-19 23:44:34] [INFO ] Computed 901 place invariants in 107 ms
[2023-03-19 23:44:35] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:44:36] [INFO ] [Nat]Absence check using 895 positive place invariants in 458 ms returned sat
[2023-03-19 23:44:36] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 23:44:41] [INFO ] After 4239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:44:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:44:43] [INFO ] After 2325ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 23:44:44] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 5 ms to minimize.
[2023-03-19 23:44:45] [INFO ] Deduced a trap composed of 12 places in 508 ms of which 1 ms to minimize.
[2023-03-19 23:44:45] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-19 23:44:46] [INFO ] Deduced a trap composed of 9 places in 657 ms of which 15 ms to minimize.
[2023-03-19 23:44:47] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 5 ms to minimize.
[2023-03-19 23:44:48] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 0 ms to minimize.
[2023-03-19 23:44:48] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 13 ms to minimize.
[2023-03-19 23:44:49] [INFO ] Deduced a trap composed of 7 places in 465 ms of which 1 ms to minimize.
[2023-03-19 23:44:49] [INFO ] Deduced a trap composed of 20 places in 460 ms of which 1 ms to minimize.
[2023-03-19 23:44:50] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 1 ms to minimize.
[2023-03-19 23:44:50] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2023-03-19 23:44:51] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2023-03-19 23:44:51] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 0 ms to minimize.
[2023-03-19 23:44:52] [INFO ] Deduced a trap composed of 11 places in 544 ms of which 1 ms to minimize.
[2023-03-19 23:44:52] [INFO ] Deduced a trap composed of 12 places in 516 ms of which 0 ms to minimize.
[2023-03-19 23:44:53] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 0 ms to minimize.
[2023-03-19 23:44:53] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 1 ms to minimize.
[2023-03-19 23:44:54] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 0 ms to minimize.
[2023-03-19 23:44:54] [INFO ] Deduced a trap composed of 12 places in 410 ms of which 1 ms to minimize.
[2023-03-19 23:44:55] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 1 ms to minimize.
[2023-03-19 23:44:55] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2023-03-19 23:44:55] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 0 ms to minimize.
[2023-03-19 23:44:56] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2023-03-19 23:44:56] [INFO ] Deduced a trap composed of 18 places in 340 ms of which 0 ms to minimize.
[2023-03-19 23:44:57] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 0 ms to minimize.
[2023-03-19 23:44:57] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 1 ms to minimize.
[2023-03-19 23:44:58] [INFO ] Deduced a trap composed of 29 places in 431 ms of which 13 ms to minimize.
[2023-03-19 23:44:58] [INFO ] Deduced a trap composed of 20 places in 341 ms of which 0 ms to minimize.
[2023-03-19 23:44:59] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 0 ms to minimize.
[2023-03-19 23:44:59] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 0 ms to minimize.
[2023-03-19 23:44:59] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2023-03-19 23:45:00] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 1 ms to minimize.
[2023-03-19 23:45:00] [INFO ] Deduced a trap composed of 20 places in 257 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-19 23:45:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:45:00] [INFO ] After 25295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 876 ms.
Support contains 143 out of 2673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2673/2673 places, 2573/2573 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 0 with 1 rules applied. Total rules applied 1 place count 2673 transition count 2572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2672 transition count 2572
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2671 transition count 2571
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 2671 transition count 2571
Applied a total of 5 rules in 253 ms. Remains 2671 /2673 variables (removed 2) and now considering 2571/2573 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 2671/2673 places, 2571/2573 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 59309 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59309 steps, saw 55799 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2671 cols
[2023-03-19 23:45:05] [INFO ] Computed 901 place invariants in 70 ms
[2023-03-19 23:45:06] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:45:07] [INFO ] [Nat]Absence check using 895 positive place invariants in 365 ms returned sat
[2023-03-19 23:45:07] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 23:45:11] [INFO ] After 3733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:45:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 23:45:14] [INFO ] After 2528ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 23:45:14] [INFO ] Deduced a trap composed of 5 places in 368 ms of which 13 ms to minimize.
[2023-03-19 23:45:15] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2023-03-19 23:45:15] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 2 ms to minimize.
[2023-03-19 23:45:16] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 1 ms to minimize.
[2023-03-19 23:45:17] [INFO ] Deduced a trap composed of 8 places in 544 ms of which 1 ms to minimize.
[2023-03-19 23:45:17] [INFO ] Deduced a trap composed of 7 places in 397 ms of which 2 ms to minimize.
[2023-03-19 23:45:18] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-19 23:45:18] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 1 ms to minimize.
[2023-03-19 23:45:18] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2023-03-19 23:45:19] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 0 ms to minimize.
[2023-03-19 23:45:19] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 0 ms to minimize.
[2023-03-19 23:45:20] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2023-03-19 23:45:20] [INFO ] Deduced a trap composed of 10 places in 441 ms of which 0 ms to minimize.
[2023-03-19 23:45:21] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 1 ms to minimize.
[2023-03-19 23:45:21] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 1 ms to minimize.
[2023-03-19 23:45:22] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2023-03-19 23:45:22] [INFO ] Deduced a trap composed of 8 places in 388 ms of which 1 ms to minimize.
[2023-03-19 23:45:23] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2023-03-19 23:45:24] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2023-03-19 23:45:24] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 3 ms to minimize.
[2023-03-19 23:45:25] [INFO ] Deduced a trap composed of 14 places in 366 ms of which 1 ms to minimize.
[2023-03-19 23:45:25] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 2 ms to minimize.
[2023-03-19 23:45:26] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 1 ms to minimize.
[2023-03-19 23:45:26] [INFO ] Deduced a trap composed of 11 places in 499 ms of which 1 ms to minimize.
[2023-03-19 23:45:27] [INFO ] Deduced a trap composed of 12 places in 517 ms of which 1 ms to minimize.
[2023-03-19 23:45:27] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 1 ms to minimize.
[2023-03-19 23:45:28] [INFO ] Deduced a trap composed of 16 places in 365 ms of which 1 ms to minimize.
[2023-03-19 23:45:28] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2023-03-19 23:45:29] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 1 ms to minimize.
[2023-03-19 23:45:29] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 0 ms to minimize.
[2023-03-19 23:45:29] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 0 ms to minimize.
[2023-03-19 23:45:30] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2023-03-19 23:45:30] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2023-03-19 23:45:31] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 0 ms to minimize.
[2023-03-19 23:45:31] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 16 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 23:45:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:45:31] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 968 ms.
Support contains 143 out of 2671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 100 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2671/2671 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2671/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 101 ms. Remains 2671 /2671 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-19 23:45:32] [INFO ] Invariant cache hit.
[2023-03-19 23:45:35] [INFO ] Implicit Places using invariants in 2590 ms returned [2656]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2609 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2670/2671 places, 2571/2571 transitions.
Applied a total of 0 rules in 99 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2810 ms. Remains : 2670/2671 places, 2571/2571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 61064 steps, run timeout after 3004 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61064 steps, saw 57377 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2571 rows 2670 cols
[2023-03-19 23:45:39] [INFO ] Computed 900 place invariants in 40 ms
[2023-03-19 23:45:40] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:45:41] [INFO ] [Nat]Absence check using 894 positive place invariants in 273 ms returned sat
[2023-03-19 23:45:41] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 23:45:46] [INFO ] After 4669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:45:47] [INFO ] Deduced a trap composed of 7 places in 521 ms of which 1 ms to minimize.
[2023-03-19 23:45:48] [INFO ] Deduced a trap composed of 9 places in 514 ms of which 1 ms to minimize.
[2023-03-19 23:45:48] [INFO ] Deduced a trap composed of 8 places in 484 ms of which 1 ms to minimize.
[2023-03-19 23:45:49] [INFO ] Deduced a trap composed of 6 places in 495 ms of which 1 ms to minimize.
[2023-03-19 23:45:49] [INFO ] Deduced a trap composed of 9 places in 547 ms of which 1 ms to minimize.
[2023-03-19 23:45:50] [INFO ] Deduced a trap composed of 6 places in 403 ms of which 1 ms to minimize.
[2023-03-19 23:45:52] [INFO ] Deduced a trap composed of 11 places in 2295 ms of which 1 ms to minimize.
[2023-03-19 23:45:53] [INFO ] Deduced a trap composed of 9 places in 436 ms of which 1 ms to minimize.
[2023-03-19 23:45:54] [INFO ] Deduced a trap composed of 7 places in 512 ms of which 1 ms to minimize.
[2023-03-19 23:45:54] [INFO ] Deduced a trap composed of 11 places in 563 ms of which 1 ms to minimize.
[2023-03-19 23:45:55] [INFO ] Deduced a trap composed of 14 places in 517 ms of which 1 ms to minimize.
[2023-03-19 23:45:56] [INFO ] Deduced a trap composed of 7 places in 447 ms of which 1 ms to minimize.
[2023-03-19 23:45:56] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 1 ms to minimize.
[2023-03-19 23:45:57] [INFO ] Deduced a trap composed of 16 places in 554 ms of which 1 ms to minimize.
[2023-03-19 23:45:58] [INFO ] Deduced a trap composed of 12 places in 613 ms of which 1 ms to minimize.
[2023-03-19 23:45:59] [INFO ] Deduced a trap composed of 9 places in 708 ms of which 1 ms to minimize.
[2023-03-19 23:45:59] [INFO ] Deduced a trap composed of 11 places in 451 ms of which 1 ms to minimize.
[2023-03-19 23:46:00] [INFO ] Deduced a trap composed of 9 places in 420 ms of which 1 ms to minimize.
[2023-03-19 23:46:00] [INFO ] Deduced a trap composed of 10 places in 432 ms of which 1 ms to minimize.
[2023-03-19 23:46:01] [INFO ] Deduced a trap composed of 13 places in 691 ms of which 1 ms to minimize.
[2023-03-19 23:46:02] [INFO ] Deduced a trap composed of 13 places in 476 ms of which 2 ms to minimize.
[2023-03-19 23:46:02] [INFO ] Deduced a trap composed of 16 places in 532 ms of which 1 ms to minimize.
[2023-03-19 23:46:03] [INFO ] Deduced a trap composed of 16 places in 403 ms of which 1 ms to minimize.
[2023-03-19 23:46:03] [INFO ] Deduced a trap composed of 20 places in 430 ms of which 1 ms to minimize.
[2023-03-19 23:46:04] [INFO ] Deduced a trap composed of 24 places in 431 ms of which 0 ms to minimize.
[2023-03-19 23:46:05] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 1 ms to minimize.
[2023-03-19 23:46:05] [INFO ] Deduced a trap composed of 15 places in 495 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-19 23:46:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:46:05] [INFO ] After 25483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 673 ms.
Support contains 143 out of 2670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 93 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 95 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
[2023-03-19 23:46:06] [INFO ] Invariant cache hit.
[2023-03-19 23:46:09] [INFO ] Implicit Places using invariants in 2439 ms returned []
[2023-03-19 23:46:09] [INFO ] Invariant cache hit.
[2023-03-19 23:46:14] [INFO ] Implicit Places using invariants and state equation in 5027 ms returned []
Implicit Place search using SMT with State Equation took 7484 ms to find 0 implicit places.
[2023-03-19 23:46:14] [INFO ] Redundant transitions in 278 ms returned []
[2023-03-19 23:46:14] [INFO ] Invariant cache hit.
[2023-03-19 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 2281 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10162 ms. Remains : 2670/2670 places, 2571/2571 transitions.
Applied a total of 0 rules in 110 ms. Remains 2670 /2670 variables (removed 0) and now considering 2571/2571 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-19 23:46:16] [INFO ] Invariant cache hit.
[2023-03-19 23:46:17] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:46:18] [INFO ] [Nat]Absence check using 894 positive place invariants in 270 ms returned sat
[2023-03-19 23:46:18] [INFO ] [Nat]Absence check using 894 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-19 23:46:22] [INFO ] After 3870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:46:23] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 1 ms to minimize.
[2023-03-19 23:46:24] [INFO ] Deduced a trap composed of 9 places in 430 ms of which 1 ms to minimize.
[2023-03-19 23:46:24] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 1 ms to minimize.
[2023-03-19 23:46:25] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 1 ms to minimize.
[2023-03-19 23:46:25] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 1 ms to minimize.
[2023-03-19 23:46:26] [INFO ] Deduced a trap composed of 7 places in 423 ms of which 1 ms to minimize.
[2023-03-19 23:46:26] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 1 ms to minimize.
[2023-03-19 23:46:27] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2023-03-19 23:46:27] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 1 ms to minimize.
[2023-03-19 23:46:28] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-19 23:46:29] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 1 ms to minimize.
[2023-03-19 23:46:29] [INFO ] Deduced a trap composed of 8 places in 368 ms of which 1 ms to minimize.
[2023-03-19 23:46:30] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 1 ms to minimize.
[2023-03-19 23:46:30] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-19 23:46:31] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 1 ms to minimize.
[2023-03-19 23:46:31] [INFO ] Deduced a trap composed of 9 places in 364 ms of which 0 ms to minimize.
[2023-03-19 23:46:32] [INFO ] Deduced a trap composed of 14 places in 380 ms of which 0 ms to minimize.
[2023-03-19 23:46:32] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 0 ms to minimize.
[2023-03-19 23:46:33] [INFO ] Deduced a trap composed of 15 places in 333 ms of which 1 ms to minimize.
[2023-03-19 23:46:33] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-19 23:46:34] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 1 ms to minimize.
[2023-03-19 23:46:34] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 1 ms to minimize.
[2023-03-19 23:46:35] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 1 ms to minimize.
[2023-03-19 23:46:35] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2023-03-19 23:46:36] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2023-03-19 23:46:36] [INFO ] Deduced a trap composed of 18 places in 393 ms of which 1 ms to minimize.
[2023-03-19 23:46:37] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 1 ms to minimize.
[2023-03-19 23:46:37] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:46:38] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 1 ms to minimize.
[2023-03-19 23:46:38] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 0 ms to minimize.
[2023-03-19 23:46:38] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 0 ms to minimize.
[2023-03-19 23:46:39] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 0 ms to minimize.
[2023-03-19 23:46:39] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 1 ms to minimize.
[2023-03-19 23:46:40] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 1 ms to minimize.
[2023-03-19 23:46:40] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 0 ms to minimize.
[2023-03-19 23:46:40] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:46:41] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 0 ms to minimize.
[2023-03-19 23:46:41] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 0 ms to minimize.
[2023-03-19 23:46:42] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-19 23:46:42] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 0 ms to minimize.
[2023-03-19 23:46:42] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:46:43] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:46:43] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 20207 ms
[2023-03-19 23:46:44] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 0 ms to minimize.
[2023-03-19 23:46:44] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-19 23:46:44] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:46:45] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 1 ms to minimize.
[2023-03-19 23:46:45] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 1 ms to minimize.
[2023-03-19 23:46:46] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-19 23:46:46] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 1 ms to minimize.
[2023-03-19 23:46:46] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 1 ms to minimize.
[2023-03-19 23:46:47] [INFO ] Deduced a trap composed of 14 places in 402 ms of which 0 ms to minimize.
[2023-03-19 23:46:47] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 0 ms to minimize.
[2023-03-19 23:46:48] [INFO ] Deduced a trap composed of 20 places in 350 ms of which 1 ms to minimize.
[2023-03-19 23:46:48] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2023-03-19 23:46:49] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 0 ms to minimize.
[2023-03-19 23:46:49] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 1 ms to minimize.
[2023-03-19 23:46:50] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 1 ms to minimize.
[2023-03-19 23:46:50] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 0 ms to minimize.
[2023-03-19 23:46:50] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 1 ms to minimize.
[2023-03-19 23:46:51] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 1 ms to minimize.
[2023-03-19 23:46:51] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-19 23:46:52] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2023-03-19 23:46:52] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 3 ms to minimize.
[2023-03-19 23:46:53] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2023-03-19 23:46:53] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 2 ms to minimize.
[2023-03-19 23:46:54] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 0 ms to minimize.
[2023-03-19 23:46:54] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 0 ms to minimize.
[2023-03-19 23:46:54] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2023-03-19 23:46:55] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 0 ms to minimize.
[2023-03-19 23:46:55] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 0 ms to minimize.
[2023-03-19 23:46:59] [INFO ] Deduced a trap composed of 25 places in 3579 ms of which 0 ms to minimize.
[2023-03-19 23:46:59] [INFO ] Deduced a trap composed of 12 places in 380 ms of which 0 ms to minimize.
[2023-03-19 23:47:00] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 16378 ms
[2023-03-19 23:47:01] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 1 ms to minimize.
[2023-03-19 23:47:01] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 1 ms to minimize.
[2023-03-19 23:47:02] [INFO ] Deduced a trap composed of 10 places in 441 ms of which 1 ms to minimize.
[2023-03-19 23:47:03] [INFO ] Deduced a trap composed of 8 places in 432 ms of which 1 ms to minimize.
[2023-03-19 23:47:03] [INFO ] Deduced a trap composed of 15 places in 482 ms of which 1 ms to minimize.
[2023-03-19 23:47:04] [INFO ] Deduced a trap composed of 8 places in 512 ms of which 1 ms to minimize.
[2023-03-19 23:47:04] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 1 ms to minimize.
[2023-03-19 23:47:05] [INFO ] Deduced a trap composed of 15 places in 522 ms of which 1 ms to minimize.
[2023-03-19 23:47:06] [INFO ] Deduced a trap composed of 8 places in 397 ms of which 1 ms to minimize.
[2023-03-19 23:47:06] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 1 ms to minimize.
[2023-03-19 23:47:07] [INFO ] Deduced a trap composed of 8 places in 401 ms of which 1 ms to minimize.
[2023-03-19 23:47:08] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 0 ms to minimize.
[2023-03-19 23:47:08] [INFO ] Deduced a trap composed of 9 places in 370 ms of which 1 ms to minimize.
[2023-03-19 23:47:09] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 0 ms to minimize.
[2023-03-19 23:47:09] [INFO ] Deduced a trap composed of 18 places in 377 ms of which 1 ms to minimize.
[2023-03-19 23:47:10] [INFO ] Deduced a trap composed of 8 places in 461 ms of which 1 ms to minimize.
[2023-03-19 23:47:10] [INFO ] Deduced a trap composed of 16 places in 442 ms of which 1 ms to minimize.
[2023-03-19 23:47:11] [INFO ] Deduced a trap composed of 18 places in 375 ms of which 1 ms to minimize.
[2023-03-19 23:47:11] [INFO ] Deduced a trap composed of 18 places in 384 ms of which 1 ms to minimize.
[2023-03-19 23:47:12] [INFO ] Deduced a trap composed of 19 places in 519 ms of which 1 ms to minimize.
[2023-03-19 23:47:12] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 1 ms to minimize.
[2023-03-19 23:47:13] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 3 ms to minimize.
[2023-03-19 23:47:13] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 1 ms to minimize.
[2023-03-19 23:47:14] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 1 ms to minimize.
[2023-03-19 23:47:14] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:47:15] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2023-03-19 23:47:15] [INFO ] Deduced a trap composed of 26 places in 416 ms of which 0 ms to minimize.
[2023-03-19 23:47:16] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2023-03-19 23:47:17] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 1 ms to minimize.
[2023-03-19 23:47:17] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 1 ms to minimize.
[2023-03-19 23:47:18] [INFO ] Deduced a trap composed of 24 places in 409 ms of which 3 ms to minimize.
[2023-03-19 23:47:18] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 17542 ms
[2023-03-19 23:47:19] [INFO ] Deduced a trap composed of 18 places in 310 ms of which 1 ms to minimize.
[2023-03-19 23:47:19] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 1 ms to minimize.
[2023-03-19 23:47:20] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2023-03-19 23:47:20] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2023-03-19 23:47:21] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
[2023-03-19 23:47:21] [INFO ] Deduced a trap composed of 13 places in 566 ms of which 0 ms to minimize.
[2023-03-19 23:47:22] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2023-03-19 23:47:22] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2023-03-19 23:47:23] [INFO ] Deduced a trap composed of 13 places in 1215 ms of which 1 ms to minimize.
[2023-03-19 23:47:24] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 0 ms to minimize.
[2023-03-19 23:47:24] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 0 ms to minimize.
[2023-03-19 23:47:25] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
[2023-03-19 23:47:25] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
[2023-03-19 23:47:25] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2023-03-19 23:47:26] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:47:26] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2023-03-19 23:47:26] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-19 23:47:26] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:47:27] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-19 23:47:27] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 8497 ms
[2023-03-19 23:47:28] [INFO ] Deduced a trap composed of 10 places in 531 ms of which 1 ms to minimize.
[2023-03-19 23:47:28] [INFO ] Deduced a trap composed of 10 places in 587 ms of which 1 ms to minimize.
[2023-03-19 23:47:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1488 ms
[2023-03-19 23:47:29] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 1 ms to minimize.
[2023-03-19 23:47:30] [INFO ] Deduced a trap composed of 16 places in 333 ms of which 1 ms to minimize.
[2023-03-19 23:47:30] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2023-03-19 23:47:31] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 0 ms to minimize.
[2023-03-19 23:47:31] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2023-03-19 23:47:32] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 1 ms to minimize.
[2023-03-19 23:47:32] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 2 ms to minimize.
[2023-03-19 23:47:33] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2023-03-19 23:47:33] [INFO ] Deduced a trap composed of 15 places in 363 ms of which 0 ms to minimize.
[2023-03-19 23:47:34] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 1 ms to minimize.
[2023-03-19 23:47:34] [INFO ] Deduced a trap composed of 16 places in 486 ms of which 1 ms to minimize.
[2023-03-19 23:47:35] [INFO ] Deduced a trap composed of 18 places in 378 ms of which 1 ms to minimize.
[2023-03-19 23:47:35] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2023-03-19 23:47:36] [INFO ] Deduced a trap composed of 16 places in 383 ms of which 0 ms to minimize.
[2023-03-19 23:47:37] [INFO ] Deduced a trap composed of 21 places in 407 ms of which 1 ms to minimize.
[2023-03-19 23:47:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 7767 ms
[2023-03-19 23:47:38] [INFO ] Deduced a trap composed of 9 places in 523 ms of which 1 ms to minimize.
[2023-03-19 23:47:38] [INFO ] Deduced a trap composed of 10 places in 497 ms of which 1 ms to minimize.
[2023-03-19 23:47:39] [INFO ] Deduced a trap composed of 8 places in 514 ms of which 1 ms to minimize.
[2023-03-19 23:47:39] [INFO ] Deduced a trap composed of 11 places in 548 ms of which 1 ms to minimize.
[2023-03-19 23:47:42] [INFO ] Deduced a trap composed of 9 places in 2399 ms of which 1 ms to minimize.
[2023-03-19 23:47:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5202 ms
[2023-03-19 23:47:42] [INFO ] After 83929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2738 ms.
[2023-03-19 23:47:45] [INFO ] After 87981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-19 23:47:45] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-19 23:47:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2670 places, 2571 transitions and 12526 arcs took 20 ms.
[2023-03-19 23:47:45] [INFO ] Flatten gal took : 274 ms
Total runtime 223996 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679269679952
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 25 (type EXCL) for 15 ShieldIIPs-PT-100B-ReachabilityCardinality-14
lola: time limit : 512 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 15 ShieldIIPs-PT-100B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 15 ShieldIIPs-PT-100B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 15 ShieldIIPs-PT-100B-ReachabilityCardinality-14
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: FINISHED task # 24 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-14
lola: result : true
lola: markings : 198
lola: fired transitions : 197
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 32 (type EXCL) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-03
lola: time limit : 598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-03
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 # 31 (type SRCH) for 3 ShieldIIPs-PT-100B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 21 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-14
lola: result : unknown
lola: fired transitions : 859
lola: tried executions : 98
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 31 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-03
lola: result : true
lola: markings : 154
lola: fired transitions : 153
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 29 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-03 (obsolete)
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-22.sara.
lola: FINISHED task # 28 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 152
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 39 (type EXCL) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-07
lola: time limit : 717 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 35 (type FNDP) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type SRCH) for 9 ShieldIIPs-PT-100B-ReachabilityCardinality-07
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 # 38 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-07
lola: result : true
lola: markings : 202
lola: fired transitions : 201
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 35 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 36 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 39 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-07 (obsolete)
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-36.sara.
lola: FINISHED task # 35 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-07
lola: result : true
lola: fired transitions : 200
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 46 (type EXCL) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: time limit : 896 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 42 (type FNDP) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type EQUN) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type SRCH) for 12 ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-43.sara.
lola: FINISHED task # 45 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: result : true
lola: markings : 150
lola: fired transitions : 149
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 42 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 43 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 46 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-12 (obsolete)
lola: FINISHED task # 43 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: result : unknown
lola: FINISHED task # 42 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 148
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 53 (type EXCL) for 6 ShieldIIPs-PT-100B-ReachabilityCardinality-04
lola: time limit : 1195 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 6 ShieldIIPs-PT-100B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 6 ShieldIIPs-PT-100B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 6 ShieldIIPs-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
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-29.sara.
lola: FINISHED task # 52 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-04
lola: result : true
lola: markings : 196
lola: fired transitions : 195
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 50 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 53 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: FINISHED task # 49 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 194
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 60 (type EXCL) for 18 ShieldIIPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 1793 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 56 (type FNDP) for 18 ShieldIIPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type EQUN) for 18 ShieldIIPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 18 ShieldIIPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 56 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-15
lola: result : true
lola: fired transitions : 116
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 57 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 59 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 60 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-15 (obsolete)
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-57.sara.
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 # 66 (type EXCL) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-00
lola: time limit : 3587 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 62 (type FNDP) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type EQUN) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 65 (type SRCH) for 0 ShieldIIPs-PT-100B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 62 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 219
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 63 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 65 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 66 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityCardinality-00 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100B-ReachabilityCardinality-00: EF true findpath
ShieldIIPs-PT-100B-ReachabilityCardinality-03: AG false tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-04: AG false tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-07: AG false tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-12: AG false tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-14: EF true tandem / insertion
ShieldIIPs-PT-100B-ReachabilityCardinality-15: AG false findpath
Time elapsed: 13 secs. Pages in use: 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-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 ShieldIIPs-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-167903715000174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-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 ;